Counting clar structures of (4,6)-fullerenes

DOI10.1016/J.AMC.2018.10.027MaRDI QIDQ2008447zbMATH OpenOpenAlexWikidataFDO

Authors Lingjuan Shi, Heping Zhang

Publication date 25 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2018.10.027

zbMATH Keywords

perfect matchingresonant setsextet pattern\((46)\)-fullereneclar structure

Mathematics Subject Classification ID

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

Recommendations

• Packing resonant hexagons in fullerenes
• Extremal fullerene graphs with the maximum Clar number
• The clar number of fullerene C\(_{24n}\) and carbon nanocone CNC\(_4[n]\)
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• An upper bound for the Clar number of fullerene graphs

Cites work

• scientific article; zbMATH DE number 913253 (Why is no real title available?)
• scientific article; zbMATH DE number 6750326 (Why is no real title available?)
• 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
• A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs
• A fully benzenoid system has a unique maximum cardinality resonant set
• A min-max theorem for plane bipartite graphs
• An upper bound for the Clar number of fullerene graphs
• Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces
• Clar structures vs Fries structures in hexagonal systems
• Closed-form formulas for the Zhang-Zhang polynomials of benzenoid structures: prolate rectangles and their generalizations
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Fullerenes with complete Clar structure
• Fullerenes with the maximum Clar number
• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
• Number of matchings of low order in (4,6)-Fullerene graphs
• On \(k\)-resonant fullerene graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• On the Clar Number of Benzenoid Graphs
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• Packing resonant hexagons in fullerenes
• The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials
• The Clar covering polynomial of hexagonal systems. I
• The Clar covering polynomial of hexagonal systems. III
• The Clar formula for a class of benzenoid systems
• The Clar formula of hexagonal polyhexes
• Unimodularity of the Clar number problem

Cited in

(14)

• Clar and sextet polynomials of boron-nitrogen fullerenes
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• Complete forcing numbers of \((4, 6)\)-fullerenes
• A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs
• Extremal fullerene graphs with the maximum Clar number
• The clar number of fullerene C\(_{24n}\) and carbon nanocone CNC\(_4[n]\)
• scientific article; zbMATH DE number 2221221 (Why is no real title available?)
• Bounds on the estrada index of ISR (4,6)-fullerenes
• scientific article; zbMATH DE number 6704624 (Why is no real title available?)
• The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
• scientific article; zbMATH DE number 6750326 (Why is no real title available?)
• Packing resonant hexagons in fullerenes
• On the sextet polynomial of fullerenes
• Edge metric dimensions via hierarchical product and integer linear programming

This page was built for publication: Counting clar structures of \((4,6)\)-fullerenes

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