On smallest 3-polytopes of given graph radius

DOI10.1016/J.DISC.2023.113322MaRDI QIDQ6404586arXivFDO

Authors Riccardo W. Maffucci, Niels Willems

Publication date 11 July 2022

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Distance in graphs (05C12)

Abstract: The $3$-polytopes are planar, $3$-connected graphs. A classical question is, for $rgeq3$, is the $2(r-1)$-gonal prism $K_{2}imes{C}_{2(r-1)}$ the unique $3$-polytope of graph radius $r$ and smallest size? Under some extra assumptions, we answer this question in the positive.

This page was built for publication: On smallest $3$-polytopes of given graph radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404586)