Sharp upper bounds on the Clar number of fullerene graphs

DOI10.7151/dmgt.2013zbMath1377.05038OpenAlexW2761460706MaRDI QIDQ1692638

Heping Zhang, Yang Gao

Publication date: 10 January 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2013

zbMATH Keywords

fullereneClar numberleapfrog transformationclar set

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
• Extremal fullerene graphs with the maximum Clar number
• An upper bound for the Clar number of fullerene graphs
• The Clar covering polynomial of hexagonal systems. I
• Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces
• Fullerenes with complete Clar structure
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Fullerenes with the maximum Clar number

This page was built for publication: Sharp upper bounds on the Clar number of fullerene graphs