On unigraphic -polytopes of radius one
arXiv:2207.02040
Abstract
We ask which degree sequences admit a unique realisation as a -polytopal graph (polyhedron) on vertices. We give an exhaustive list of these sequences for the case where one degree equals and exactly two or three of them equal . We also find all -polytopes of radius one with , and those with edges, by developing a fast algorithm and making use of High Performance Computing.