A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs

被引：1
|
作者：
Ke, Xiaoling [1 ]
机构：
[1] Minjiang Univ Fuzhou, Dept Math, Fuzhou 350108, Fujian, Peoples R China
来源：
JOURNAL OF MATHEMATICAL CHEMISTRY | 2012年 / 50卷 / 01期
关键词：
Generalized polyomino graph; Elementary component; Perfect matching; Essentially disconnected; Lower bound; SQUARE-CELL CONFIGURATIONS;
D O I：
10.1007/s10910-011-9900-x
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
An essentially disconnected generalized polyomino graph is defined as a generalized polyomino graph with some perfect matchings and forbidden edges. The number of perfect matchings of a generalized polyomino graph G is the product of the number of perfect matchings of each elementary component in G. In this paper, we obtain a lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs.
引用
收藏
页码：131 / 140
页数：10
相关论文
共 50 条
  • [41] THE SHARP LOWER BOUND FOR THE SPECTRAL RADIUS OF CONNECTED GRAPHS WITH THE INDEPENDENCE NUMBER
    Jin, Ya-Lei
    Zhang, Xiao-Dong
    TAIWANESE JOURNAL OF MATHEMATICS, 2015, 19 (02): : 419 - 431
  • [42] A New Lower Bound on the Potential-Ramsey Number of Two Graphs
    Du, Jin-zhi
    Yin, Jian-hua
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2021, 37 (01): : 176 - 182
  • [43] A New Lower Bound on the Potential-Ramsey Number of Two Graphs
    Jin-zhi DU
    Jian-hua YIN
    Acta Mathematicae Applicatae Sinica, 2021, 37 (01) : 176 - 182
  • [44] A tight lower bound on the matching number of graphs via Laplacian eigenvalues
    Gu, Xiaofeng
    Liu, Muhuo
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 101
  • [45] A New Lower Bound on the Potential-Ramsey Number of Two Graphs
    Jin-zhi Du
    Jian-hua Yin
    Acta Mathematicae Applicatae Sinica, English Series, 2021, 37 : 176 - 182
  • [46] Improved lower bound for the list chromatic number of graphs with no Kt minor
    Steiner, Raphael
    COMBINATORICS PROBABILITY & COMPUTING, 2022, 31 (06): : 1070 - 1075
  • [47] A lower bound for the number of orientable triangular embeddings of some complete graphs
    Grannell, M. J.
    Knor, M.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (02) : 216 - 225
  • [48] A lower bound on the number of removable ears of 1-extendable graphs
    Zhai, Shaohui
    Lucchesi, Claudio L.
    Guo, Xiaofeng
    DISCRETE MATHEMATICS, 2010, 310 (05) : 1123 - 1126
  • [49] A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
    Grannell, M. J.
    Griggs, T. S.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2008, 98 (04) : 637 - 650
  • [50] A new lower bound on the maximum number of plane graphs using production matrices
    Huemer, Clemens
    Pilz, Alexander
    Silveira, Rodrigo, I
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 84 : 36 - 49
12345