Cyclic 7-edge-cuts in fullerene graphs
From MaRDI portal
Publication:848197
DOI10.1007/s10910-009-9599-0zbMath1200.92050OpenAlexW2053139966MaRDI QIDQ848197
František Kardoš, Matjaž Krnc, Borut Lužar, Riste Škrekovski
Publication date: 2 March 2010
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-009-9599-0
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)
Related Items (6)
Nice pairs of disjoint pentagons in fullerene graphs ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Characterizing the fullerene graphs with the minimum forcing number 3 ⋮ On the maximum weight of a planar graph of given order and size ⋮ Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes ⋮ 2-resonant fullerenes
Cites Work
- On the number of Kekulé structures in capped zigzag nanotubes
- A note on the cyclical edge-connectivity of fullerene graphs
- Cyclic edge-cuts in fullerene graphs
- On cyclic edge-connectivity of fullerenes
- On lower bounds of number of perfect matchings in fullerene graphs
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- \(k\)-resonance of open-ended carbon nanotubes
- On some structural properties of fullerene graphs
This page was built for publication: Cyclic 7-edge-cuts in fullerene graphs
