A note on the cyclical edge-connectivity of fullerene graphs
From MaRDI portal
Publication:926922
DOI10.1007/s10910-006-9185-7zbMath1139.05327OpenAlexW2089007050MaRDI QIDQ926922
Publication date: 21 May 2008
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-006-9185-7
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)
Related Items (17)
The anti-Kekulé number of graphs ⋮ Nice pairs of disjoint pentagons in fullerene graphs ⋮ Nice pairs of odd cycles in fullerene graphs ⋮ Finding more perfect matchings in leapfrog fullerenes ⋮ Shortest perfect pseudomatchings in fullerene graphs ⋮ Cyclic 7-edge-cuts in fullerene graphs ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ On the anti-Kekulé number and odd cycle transversal of regular graphs ⋮ The isolated-pentagon rule and nice substructures in fullerenes ⋮ On cyclic edge-connectivity of fullerenes ⋮ Extremal fullerene graphs with the maximum Clar number ⋮ Forcing matching numbers of fullerene graphs ⋮ On some structural properties of generalized fullerene graphs with 13 pentagonal faces ⋮ On the anti-Kekulé problem of cubic graphs ⋮ Fullerenes with the maximum Clar number ⋮ Packing resonant hexagons in fullerenes ⋮ 2-resonant fullerenes
Cites Work
- Matching theory
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- On lower bounds of number of perfect matchings in fullerene graphs
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- New lower bound on the number of perfect matchings in fullerene graphs
- On some structural properties of fullerene graphs
- Unnamed Item
This page was built for publication: A note on the cyclical edge-connectivity of fullerene graphs
