The anti-forcing spectra of (4,6)-fullerenes

Lingjuan Shi, Heping Zhang and Lifang Zhao

Applied Mathematics and Computation, 2022, vol. 425, issue C

Abstract: For an edge subset S of connected graph G, if G−S has only one perfect matching M, then S is called an anti-forcing set of M. The number of edges in a smallest anti-forcing set of M is the anti-forcing number of M, generally indicated by the symbol af(G,M). For a graph G, its anti-forcing spectrum is defined as the integer set Specaf(G):={af(G,M):M is a perfect matching of G}. In this paper, we show that for a (4,6)-fullerene graph Tn with cyclic edge-connectivity 3, Specaf(Tn)=[n+3,2n+4]. Moreover, we show that for any perfect matching M of a (4,6)-fullerene graph G, a minimum anti-forcing set S of M and each M-alternating facial boundary share exactly one edge. Applying this conclusion, we prove that the minimum anti-forcing number of a lantern structure (4,6)-fullerene of order n is ⌊n8⌋+2, and Specaf(Bn)=[⌊n8⌋+2,⌊n3⌋+2].

Keywords: Perfect matching; (4,6)-Fullerene graphs; Anti-forcing number; Anti-forcing spectrum (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322001746
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:425:y:2022:i:c:s0096300322001746

DOI: 10.1016/j.amc.2022.127090

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().