Year: 2026
Type: article
Abstract: Despite being composed exclusively of pentagonal and hexagonal faces, fullerene graphs (planar, cubic, and 3-connected) exhibit surprising properties.One of the most studied characteristics is the graph diameter, which remains difficult to determine in general.In 2012, Andova and Škrekovski formulated a conjecture regarding this parameter.They proposed that for a fullerene graph with n vertices, the diameter satisfies diamThis conjecture is inspired by the study of a family of spherical fullerene graphs Gi,j, with i, j ∈ N * and i ≤ j, which also possess icosahedral symmetry.However, in 2023, Silva et al. proved the existence of infinite families of fullerene graphs with icosahedral symmetry, say Gi,2i, that contradict this conjecture.Thus, a natural question that arises is whether every graph Gi,j, when j is
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7127057306
