Packing resonant hexagons in fullerenes

DOI10.1016/J.DISOPT.2014.05.002MaRDI QIDQ2339827zbMATH OpenOpenAlexFDO

Authors Jessica Ann Carr, Dong Ye, Xiao-Feng Wang

Publication date 9 April 2015

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2014.05.002

zbMATH Keywords

resonant setClar numberfullerene

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Counting clar structures of \((4,6)\)-fullerenes
• On \(k\)-resonant fullerene graphs
• 2-resonant fullerenes
• An upper bound for the Clar number of fullerene graphs
• Extremal fullerene graphs with the maximum Clar number

Cites work

• scientific article; zbMATH DE number 3150487 (Why is no real title available?)
• scientific article; zbMATH DE number 3369404 (Why is no real title available?)
• A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
• A maximal cover of hexagonal systems
• 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
• Extremal fullerene graphs with the maximum Clar number
• Finding more perfect matchings in leapfrog fullerenes
• Forcing hexagons in hexagonal systems
• Fullerene graphs have exponentially many perfect matchings
• Fullerene graphs with exponentially many perfect matchings
• Fullerenes with complete Clar structure
• Leapfrog fullerenes have many perfect matchings
• Odd Cycle Transversals and Independent Sets in Fullerene Graphs
• On \(k\)-resonant fullerene graphs
• On cyclic edge-connectivity of fullerenes
• The independence numbers of fullerenes and benzenoids
• Unimodularity of the Clar number problem

Cited in

(7)

• On \(k\)-resonant fullerene graphs
• Counting clar structures of \((4,6)\)-fullerenes
• scientific article; zbMATH DE number 6511304 (Why is no real title available?)
• Clar structures vs Fries structures in hexagonal systems
• Every extremal fullerene graph with no less than 60 vertices is 2-resonant
• Fullerenes with the maximum Clar number
• The fullerene graphs with a perfect star packing

This page was built for publication: Packing resonant hexagons in fullerenes

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