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 条

[1] A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
Xiaoling Ke
Journal of Mathematical Chemistry, 2012, 50 : 131 - 140
[2] Elementary components of essentially disconnected polyomino graphs
Shouliu Wei
Xiaoling Ke
Journal of Mathematical Chemistry, 2010, 47 : 496 - 504
[3] Elementary components of essentially disconnected polyomino graphs
Wei, Shouliu
Ke, Xiaoling
JOURNAL OF MATHEMATICAL CHEMISTRY, 2010, 47 (01) : 496 - 504
[4] The structure character of essentially disconnected polyomino graphs
Liu Zhifang
Rongsi, C.
JOURNAL OF MATHEMATICAL CHEMISTRY, 2011, 49 (02) : 489 - 506
[5] The structure character of essentially disconnected polyomino graphs
Liu Zhifang
C. Rongsi
Journal of Mathematical Chemistry, 2011, 49 : 489 - 506
[6] The Number of Normal Components of Essentially Disconnected Coronoid Systems
Ke, Xiaoling
POLYCYCLIC AROMATIC COMPOUNDS, 2016, 36 (02) : 89 - 105
[7] LOWER BOUND ON THE NUMBER OF HAMILTONIAN CYCLES OF GENERALIZED PETERSEN GRAPHS
Lu, Weihua
Yang, Chao
Ren, Han
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (01) : 297 - 305
[8] THE LOWER BOUND FOR THE NUMBER OF 1-FACTORS IN GENERALIZED PETERSEN GRAPHS
Ren, H.
Yang, C.
Wang, J.
BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2017, 43 (06) : 1925 - 1937
[9] A Lower Bound for the Radio Number of Graphs
Bantva, Devsi
ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2019, 2019, 11394 : 161 - 173
[10] Lower bound number of irreducible graphs on surfaces
Liu, Y
Liu, YP
ACTA MATHEMATICA SCIENTIA, 1998, 18 (03) : 333 - 339

← 1 2 3 4 5 →