On the Clar number of graphene fragment

DOI10.1007/S10910-021-01214-WMaRDI QIDQ830854zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 10 May 2021

Published in Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10910-021-01214-w

zbMATH Keywords

benzenoid graphClar numbergraphene fragment

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6704624
• Extremal fullerene graphs with the maximum Clar number
• AN INDEX THEOREM FOR GRAPHENE
• An upper bound for the Clar number of fullerene graphs
• A comprehensive lattice-stability limit surface for graphene
• TIGHT-BINDING PARAMETERS FOR GRAPHENE
• On configurational weak phase transitions in graphene
• Sharp upper bounds on the Clar number of fullerene graphs
• Graphene ground states

Cites work

• An upper bound for the Clar number of fullerene graphs
• Clar and fries numbers for benzenoids
• Clar structures vs Fries structures in hexagonal systems
• Extremal fullerene graphs with the maximum Clar number
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• Fullerenes with complete Clar structure
• scientific article; zbMATH DE number 6750326 (Why is no real title available?)
• Internal Kekulé structures for graphene and general patches
• Number of matchings of low order in (4,6)-Fullerene graphs
• On the Clar Number of Benzenoid Graphs
• On the distribution of bonds in cyclofusene
• The Clar formulas of a benzenoid system and the resonance graph
• Unimodularity of the Clar number problem

Cited in

(1)

• Binary Coding of Resonance Graphs of Catacondensed Polyhexes

This page was built for publication: On the Clar number of graphene fragment

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