Clar structures vs Fries structures in hexagonal systems
From MaRDI portal
Publication:2318231
DOI10.1016/j.amc.2018.02.014zbMath1427.05186OpenAlexW2789977056WikidataQ130181725 ScholiaQ130181725MaRDI QIDQ2318231
Dong Ye, Dalal Alrowaili, Shao-hui Zhai
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
Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniquely forced perfect matching and unique 3-edge-coloring
- A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
- A fully benzenoid system has a unique maximum cardinality resonant set
- Unimodularity of the Clar number problem
- Extremal fullerene graphs with the maximum Clar number
- Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
- An upper bound for the Clar number of fullerene graphs
- A maximal cover of hexagonal systems
- Matching theory
- Forcing polynomials of benzenoid parallelogram and its related benzenoids
- Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial
- A mathematical programming model for computing the fries number of a fullerene
- Packing resonant hexagons in fullerenes
- Clar and fries numbers for benzenoids
- Onk-Resonant Fullerene Graphs
- The Complexity of Enumeration and Reliability Problems
- A constructive enumeration of fusenes and benzenoids
- On the Clar Number of Benzenoid Graphs
This page was built for publication: Clar structures vs Fries structures in hexagonal systems
