On the anti-forcing number of fullerene graphs
From MaRDI portal
Publication:5279165
zbMath1462.05344arXiv1503.01900MaRDI QIDQ5279165
Heping Zhang, Qin Yang, Yu-qing Lin
Publication date: 19 July 2017
Full work available at URL: https://arxiv.org/abs/1503.01900
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Related Items (8)
Nice pairs of disjoint pentagons in fullerene graphs ⋮ The fullerene graphs with a perfect star packing ⋮ Single coronoid systems with an anti-forcing edge ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ The isolated-pentagon rule and nice substructures in fullerenes ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Forcing and anti-forcing edges in bipartite graphs ⋮ Plane elementary bipartite graphs with forcing or anti-forcing edges
This page was built for publication: On the anti-forcing number of fullerene graphs
