Fullerenes with the maximum Clar number

DOI10.1016/j.dam.2015.08.007zbMath1330.05149arXiv1410.7030OpenAlexW1585563435MaRDI QIDQ5962516

Yang Gao, Qiuli Li, Heping Zhang

Publication date: 12 February 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.7030

zbMATH Keywords

fullereneClar numberClar structureKekulé structureleapfrog transformation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

The fullerene graphs with a perfect star packing ⋮ Sharp upper bounds on the Clar number of fullerene graphs ⋮ Counting clar structures of \((4,6)\)-fullerenes

Uses Software

• Fullerene

Cites Work

• 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}\)
• Unimodularity of the Clar number problem
• A note on the cyclical edge-connectivity of fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• Extremal fullerene graphs with the maximum Clar number
• Forcing matching numbers of fullerene graphs
• An upper bound for the Clar number of fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• New lower bound on the number of perfect matchings in fullerene graphs
• The Clar covering polynomial of hexagonal systems. I
• Packing resonant hexagons in fullerenes
• 2-resonant fullerenes
• Fullerenes with complete Clar structure
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

This page was built for publication: Fullerenes with the maximum Clar number