Complete Forcing Numbers of Random Multiple Hexagonal Chains

Let G be a simple connected graph with vertex set V(G) and edge set E(G) that admits a perfect matching M. A forcing set of M is a subset of M contained in no other perfect matchings of G. The minimum cardinality of forcing sets is the forcing number of M. A complete forcing set of G, recently intro...

Full description

Saved in:
Bibliographic Details
Published inPolycyclic aromatic compounds Vol. 42; no. 10; pp. 7091 - 7099
Main Authors Xue, Shuting, Bian, Hong, Wei, Lina, Yu, Haizheng, Xu, Shou-Jun
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis 26.11.2022
Taylor & Francis Ltd
Subjects
Chains
complete forcing set
Forcing set
Matching
perfect matching
random multiple hexagonal chains
Vertex sets
Online AccessGet full text

Cover

More Information
Summary:Let G be a simple connected graph with vertex set V(G) and edge set E(G) that admits a perfect matching M. A forcing set of M is a subset of M contained in no other perfect matchings of G. The minimum cardinality of forcing sets is the forcing number of M. A complete forcing set of G, recently introduced by Xu et al. [Complete forcing numbers of catacondensed hexagonal systems, J. Combin. Optim. 29(4) (2015) 803-814], is a subset S of E(G) on which the restriction of any perfect matching M of G is a forcing set of M. A complete forcing set of the smallest cardinality is called a minimum complete forcing set, and its cardinality is the complete forcing number of G, denoted by cf(G). In this paper, we present the complete forcing sets and complete forcing number of random multiple hexagonal chains.
ISSN:1040-6638
1563-5333
DOI:10.1080/10406638.2021.1996404