Continuous Forcing Spectra of Even Polygonal Chains

作     者：He-ping ZHANG Xiao-yan JIANG He-ping ZHANG;Xiao-yan JIANG

作者机构：School of Mathematics and StatisticsLanzhou UniversityLanzhou 730000China School of Mathematics and StatisticsHuizhou UniversityHuizhou 516007China 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2021年第37卷第2期

页      面：337-347页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：supported by the National Natural Science Foundation of China(Nos.11871256 11371180 11226286) 

主　　题：perfect matching forcing number forcing spectrum polyomino even polygonal chain Z-transformation graph 

摘      要：Let G be a graph that admits a perfect matching M.A forcing set S for a perfect matching M is a subset of M such that it is contained in no other perfect matchings of *** cardinality of a forcing set of M with the smallest size is called the forcing number of M,denoted by f(G,M).The forcing spectrum of G is defined as:Spec(G)={f(G,M)|M is a perfect matching of G}.In this paper,by applying the Ztransformation graph(resonance graph)we show that for any polyomino with perfect matchings and any even polygonal chain,their forcing spectra are integral *** we obtain some sharp bounds on maximum and minimum forcing numbers of hexagonal chains with given number of *** spectra of two extremal chains are determined.