Data di Pubblicazione:
2023
Abstract:
The 3-polytopes are planar, 3-connected graphs. A classical question is, given r≥3, is the 2(r−1)-gonal prism K2×C2(r−1) the unique 3-polytope of graph radius r and smallest size? Under some extra assumptions, we answer this question in the positive.
Tipologia CRIS:
03A-Articolo su Rivista
Keywords:
3-polytope; Extremal problem; Graph radius; Planar graph; Prism
Elenco autori:
Maffucci R.W.; Willems N.
Link alla scheda completa:
Pubblicato in: