Characterizing the fullerene graphs with the minimum forcing number 3

DOI10.1016/J.DAM.2021.02.001MaRDI QIDQ2656966zbMATH OpenOpenAlexFDO

Authors Lingjuan Shi, Heping Zhang, Ruizhi Lin

Publication date 17 March 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.03750

zbMATH Keywords

anti-forcing numberfullerene graphgeneralized patchminimum forcing numberperfect matching

Mathematics Subject Classification ID

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

Abstract: The minimum forcing number of a graph $G$ is the smallest number of edges simultaneously contained in a unique perfect matching of $G$. Zhang, Ye and Shiu cite{HDW} showed that the minimum forcing number of any fullerene graph was bounded below by $3$. However, we find that there exists exactly one excepted fullerene $F_{24}$ with the minimum forcing number $2$. In this paper, we characterize all fullerenes with the minimum forcing number $3$ by a construction approach. This also solves an open problem proposed by Zhang et al. We also find that except for $F_{24}$, all fullerenes with anti-forcing number $4$ have the minimum forcing number $3$. In particular, the nanotube fullerenes of type $(4,2)$ are such fullerenes.

Recommendations

• Forcing and anti-forcing numbers of (3,6)-fullerenes
• On the anti-forcing number of fullerene graphs
• Forcing matching numbers of fullerene graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes

Cites work

• Cyclic 7-edge-cuts in fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and (k,6)-cages
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• Forcing matching numbers of fullerene graphs
• scientific article; zbMATH DE number 3202997 (Why is no real title available?)
• On k-resonant fullerene graphs
• On cyclic edge-connectivity of fullerenes
• On forcing matching number of boron-nitrogen fullerene graphs
• On the anti-forcing number of benzenoids
• On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
• The isolated-pentagon rule and nice substructures in fullerenes
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

Cited in

(11)

• Continuous forcing spectra of even polygonal chains
• Complete forcing numbers of hexagonal systems. II
• On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes
• On the anti-forcing number of fullerene graphs
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• Complete forcing numbers of complete and almost-complete multipartite graphs
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• On forcing matching number of boron-nitrogen fullerene graphs
• Complete forcing numbers of (4, 6)-fullerenes
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• Forcing matching numbers of fullerene graphs

This page was built for publication: Characterizing the fullerene graphs with the minimum forcing number 3

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