Continuous Forcing Spectra of Even Polygonal Chains

被引:9
|
作者
Zhang, He-ping [1 ]
Jiang, Xiao-yan [2 ]
机构
[1] Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Peoples R China
[2] Huizhou Univ, Sch Math & Stat, Huizhou 516007, Peoples R China
来源
基金
中国国家自然科学基金;
关键词
perfect matching; forcing number; forcing spectrum; polyomino; even polygonal chain; Z-transformation graph; Z-TRANSFORMATION GRAPHS; ANTI-KEKULE NUMBER; PERFECT MATCHINGS;
D O I
10.1007/s10255-021-1010-3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 G. The 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) divide M is a perfect matching of G}. In this paper, by applying the Z-transformation graph (resonance graph) we show that for any polyomino with perfect matchings and any even polygonal chain, their forcing spectra are integral intervals. Further we obtain some sharp bounds on maximum and minimum forcing numbers of hexagonal chains with given number of kinks. Forcing spectra of two extremal chains are determined.
引用
收藏
页码:337 / 347
页数:11
相关论文
共 50 条
  • [31] Generalized formulation for resonance frequency of even polygonal microstrip antennas
    Gyan, Deepankar Shri
    Ray, K. P.
    ELECTROMAGNETICS, 2022, 42 (02) : 102 - 115
  • [32] Separability by two lines and by nearly straight polygonal chains
    Hurtado, F
    Mora, M
    Ramos, PA
    Seara, C
    DISCRETE APPLIED MATHEMATICS, 2004, 144 (1-2) : 110 - 122
  • [33] Computing obnoxious 1-corner polygonal chains
    Díaz-Báñez, JM
    Hurtado, F
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (04) : 1117 - 1128
  • [34] The expected values of Wiener indices in random polygonal chains
    Wang, Hong-yong
    Deng, Hanyuan
    Jiang, Qin
    ARS COMBINATORIA, 2016, 125 : 151 - 160
  • [35] The (degree-) Kirchhoff indices in random polygonal chains
    Li, Jiajian
    Wang, Weizhong
    DISCRETE APPLIED MATHEMATICS, 2021, 304 : 63 - 75
  • [36] Enumeration of the Gutman and Schultz indices in the random polygonal chains
    Zhu, Wanlin
    Fang, Minglei
    Geng, Xianya
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (11) : 10826 - 10845
  • [37] Polygonal chains cannot lock in 4D
    Cocan, R
    O'Rourke, J
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 20 (03): : 105 - 129
  • [38] An Efficient GIS Algorithm for Detecting Topological Polygonal Chains
    Qiu Yonghong
    Zeng Yongnian
    Guoqing, Sun
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY APPLICATIONS (ICCITA), 2016, 53 : 293 - 298
  • [39] Maximum fractional forcing number of the powers of even cycles
    Ebrahimi, Javad B.
    Karimy, Sajed
    Ranjbarzadeh, Shayan
    ADVANCED STUDIES-EURO-TBILISI MATHEMATICAL JOURNAL, 2023, 16 (01): : 1 - 11
  • [40] Statistics of transitions for Markov chains with periodic forcing
    Herrmann, Samuel
    Landon, Damien
    STOCHASTICS AND DYNAMICS, 2015, 15 (04)