Clar structures vs Fries structures in hexagonal systems

DOI10.1016/J.AMC.2018.02.014MaRDI QIDQ2318231zbMATH OpenOpenAlexWikidataFDO

Authors Shaohui Zhai, Dalal Alrowaili, Dong Ye

Publication date 14 August 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.02.014

zbMATH Keywords

Clar numberFries numberhexagonal system

Mathematics Subject Classification ID

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

Recommendations

• Clar sets and maximum forcing numbers of hexagonal systems
• Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
• The Clar covering polynomial of hexagonal systems. III
• On the Clar Number of Benzenoid Graphs
• Clar and fries numbers for benzenoids

Cites work

• A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
• A constructive enumeration of fusenes and benzenoids
• A fully benzenoid system has a unique maximum cardinality resonant set
• A mathematical programming model for computing the fries number of a fullerene
• A maximal cover of hexagonal systems
• An upper bound for the Clar number of fullerene graphs
• Clar and fries numbers for benzenoids
• Clar sets and maximum forcing numbers of hexagonal systems
• Extremal fullerene graphs with the maximum Clar number
• Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial
• Forcing polynomials of benzenoid parallelogram and its related benzenoids
• HOMO-LUMO maps for chemical graphs
• scientific article; zbMATH DE number 3150487 (Why is no real title available?)
• scientific article; zbMATH DE number 4083659 (Why is no real title available?)
• Matching theory
• Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
• On k-resonant fullerene graphs
• On the Clar Number of Benzenoid Graphs
• Packing resonant hexagons in fullerenes
• The Complexity of Enumeration and Reliability Problems
• Unimodularity of the Clar number problem
• Uniquely forced perfect matching and unique 3-edge-coloring

Cited in

(9)

• Counting clar structures of \((4,6)\)-fullerenes
• The Clar formula of hexagonal polyhexes
• Pairwise disagreements of Kekulé, Clar, and Fries numbers for benzenoids: a mathematical and computational investigation
• A network flow approach to a common generalization of Clar and Fries numbers
• Tutte polynomials for some chemical polycyclic graphs
• Clar and Fries structures for fullerenes
• On the Clar number of graphene fragment
• Hypergraphs and the Clar problem in hexagonal systems
• Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems

This page was built for publication: Clar structures vs Fries structures in hexagonal systems

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