Extremal fullerene graphs with the maximum Clar number

DOI10.1016/j.dam.2009.06.007zbMath1213.05258arXiv0801.1788OpenAlexW2144254936MaRDI QIDQ967370

Heping Zhang, Dong Ye

Publication date: 28 April 2010

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

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

zbMATH Keywords

perfect matchingClar numberfullerene graph\(C_{60}\)sextet pattern

Mathematics Subject Classification ID

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

Related Items (15)

Super face d-antimagic labeling for disjoint union of toroidal fullerenes ⋮ A minimax result for perfect matchings of a polyomino graph ⋮ Labelings of type \((1, 1, 1)\) for Klein bottle fullerenes ⋮ On the Clar number of graphene fragment ⋮ Nice pairs of disjoint pentagons in fullerene graphs ⋮ A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\) ⋮ Sharp upper bounds on the Clar number of fullerene graphs ⋮ The complexity of the Clar number problem and an exact algorithm ⋮ Fullerenes with complete Clar structure ⋮ A mathematical programming model for computing the fries number of a fullerene ⋮ Fullerenes with the maximum Clar number ⋮ Clar structures vs Fries structures in hexagonal systems ⋮ Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces ⋮ Packing resonant hexagons in fullerenes ⋮ 2-resonant fullerenes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kekulé structures and the face independence number of a fullerene
• A note on the cyclical edge-connectivity of fullerene graphs
• An upper bound for the Clar number of fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages

This page was built for publication: Extremal fullerene graphs with the maximum Clar number