Continuous forcing spectrum of regular hexagonal polyhexes

Yaxian Zhang and Heping Zhang

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

Abstract: For any perfect matching M of a graph G, the forcing number (resp. anti-forcing number) of M is the smallest cardinality of an edge subset S⊆M (resp. S⊆E(G)∖M) such that the graph G−V(S) (resp. G−S) has a unique perfect matching. The forcing spectrum of G is the set of forcing numbers of all perfect matchings of G. Afshani et al. [2] proved that any finite set of positive integers can be the forcing spectrum of a planar bipartite graph. A polyhex is a 2-connected plane bipartite graph whose interior faces are regular hexagons. In this paper, we give the minimum forcing number and anti-forcing number of a polyhex with a 3-divisible perfect matching. Further, we prove that the forcing spectrum of any regular hexagonal polyhex is continuous, i.e. an integer interval, by applying some changes on prolate triangle polyhexes to obtain a sequence of perfect matchings of the graph.

Keywords: Polyhex; Regular hexagonal polyhex; Prolate triangle polyhex; Perfect matching; Forcing number; Forcing spectrum (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322001448
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:s0096300322001448

DOI: 10.1016/j.amc.2022.127058

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 ().