Fullerene graphs of small diameter

MaRDI QIDQ5005695zbMATH OpenFDO

Authors Diego Nicodemos, Matěj Stehlík

Publication date 10 August 2021

Full work available at URL https://arxiv.org/abs/1604.01934, https://match.pmf.kg.ac.rs/electronic_versions/Match77/n3/match77n3_725-728.pdf

Mathematics Subject Classification ID

Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Abstract: A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $sqrt4n/3$, where $n$ is the number of vertices. This disproves a conjecture of Andova and v{S}krekovski [MATCH Commun. Math. Comput. Chem. 70 (2013) 205-220], who conjectured that every fullerene graph on $n$ vertices has diameter at least $lfloorsqrt5n/3floor-1$.

Recommendations

• On the diameter and some related invariants of fullerene graphs
• scientific article; zbMATH DE number 6749528
• Diameter of fullerene graphs with fully icosahedral symmetry
• Long cycles in fullerene graphs
• scientific article; zbMATH DE number 1618181

Cited in

(11)

• On some structural properties of fullerene graphs
• On the diameter and some related invariants of fullerene graphs
• Metric dimension of fullerene graphs
• scientific article; zbMATH DE number 6749528 (Why is no real title available?)
• Fullerenes with distant pentagons
• scientific article; zbMATH DE number 6181074 (Why is no real title available?)
• Diameter of fullerene graphs with fully icosahedral symmetry
• Long cycles in fullerene graphs
• On the diameter of spherical fullerene graphs
• Settling the Andova and Škrekovski conjecture for spherical fullerene graphs \(G_{i, ki}\)
• The AVD-total chromatic number of fullerene molecular graphs

This page was built for publication: Fullerene graphs of small diameter

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