On smallest $3$-polytopes of given graph radius
Combinatorics
2022-07-12 v1
Abstract
The -polytopes are planar, -connected graphs. A classical question is, for , is the -gonal prism the unique -polytope of graph radius and smallest size? Under some extra assumptions, we answer this question in the positive.
Cite
@article{arxiv.2207.04743,
title = {On smallest $3$-polytopes of given graph radius},
author = {Riccardo W. Maffucci and Niels Willems},
journal= {arXiv preprint arXiv:2207.04743},
year = {2022}
}