Extremal polyomino chains on k-matchings and k-independent sets

被引:36
作者
Zeng, Yanqiu [1 ]
Zhang, Fuji [1 ]
机构
[1] Xiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R China
基金
中国国家自然科学基金;
关键词
polyomino chain; square lattice; graph invariant; Z-polynomial; Y-polynomial; k-matching; k-independent set; total pi-electron energy;
D O I
10.1007/s10910-005-9039-8
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Denote by T-n the set of polyomino chains with n squares. For any T-n is an element of T-n, let m(k)(T-n) and i(k)(T-n) be the number of k-matchings and k-independent sets of T-n, respectively. In this paper, we show that for any polyomino chain T-n is an element of T-n and any k >= 0, m(k)(L-n) >= m(k) (T-n) >= m(k) (Z(n)) and i(k) (L-n) <= i(k) (T-n) <= i(k) (Z(n)), with the left equalities holding for all k only if Tn = Ln, and the right equalities holding for all k only if T-n = Z(n), where L-n and Z(n) are the linear chain and the zig-zag chain, respectively.
引用
收藏
页码:125 / 140
页数:16
相关论文
共 23 条
[1]  
[Anonymous], 1980, PUBL I MATH BEOGRAD
[2]  
[Anonymous], 1977, PUBLICATIONS IINSTIT
[3]   HARD-SQUARE LATTICE GAS [J].
BAXTER, RJ ;
ENTING, IG ;
TSANG, SK .
JOURNAL OF STATISTICAL PHYSICS, 1980, 22 (04) :465-489
[4]   ENTROPY OF HARD HEXAGONS [J].
BAXTER, RJ ;
TSANG, SK .
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1980, 13 (03) :1023-1030
[5]   The number of independent sets in a grid graph [J].
Calkin, NJ ;
Wilf, HS .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (01) :54-60
[6]  
ENGEL K, 1990, FIBONACCI QUART, V28, P72
[7]   INTRODUCTION TO MATCHING POLYNOMIALS [J].
FARRELL, EJ .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 27 (01) :75-86
[8]  
FINCH S, HARD SQUARE ENTROPY
[9]  
FINCH S, SEVERAL CONSTANTS AR
[10]  
GODSIL CD, 1979, J GRAPH THEORY B, V27, P75