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

共 20 条

[1]

[Anonymous], 1988, Kekule Structures in Benzenoid Hydrocarbons

[2] COMBINATORIAL PROPERTIES OF POLYOMINOES [J].

BERGE, C ;

CHEN, CC ;

CHVATAL, V ;

SEOW, CS .

COMBINATORICA, 1981, 1 (03) :217-224

[3]

BONDY JA, 1976, GRAPH THEORY ITS APP

[4]

Chen R., 2005, GRAPHS COMB, V21, P515

[5] CHESSBOARD DOMINATION PROBLEMS [J].

COCKAYNE, EJ .

DISCRETE MATHEMATICS, 1990, 86 (1-3) :13-20

[6] ON THE QUEEN DOMINATION PROBLEM [J].

GRINSTEAD, CM ;

HAHNE, B ;

VANSTONE, D .

DISCRETE MATHEMATICS, 1990, 86 (1-3) :21-26

[7]

Harary F, 1997, INT J QUANTUM CHEM, V62, P353, DOI 10.1002/(SICI)1097-461X(1997)62:4<353::AID-QUA3>3.0.CO

[8]

2-V

[9]

Harary F, 1996, MOL ENG, V6, P415, DOI DOI 10.1007/BF00440413

[10]

John P., 1987, Appl. Math. (Warsaw), V19, P465

← 1 2 →