论文信息 - King and domino polynomials for polyomino graphs

King and domino polynomials for polyomino graphs

For the purposes of treating several enumeration problems of lattice dynamics, king and domino polynomials are defined for a chessboard, polyomino, or square lattice of arbitrary size and shape. These polynomials are shown to be closely related to the partition function of the dimer statistics, the number of Kekule structures, or maximum matching number. Several recursion formulas are found. Interpretation of these newly proposed quantities is given, and the possibility of extending them to the important physical models is discussed.

H. Hosoya | A. Motoyama

[1] John Riordan,et al. Introduction to Combinatorial Analysis , 1958 .

[2] P. W. Kasteleyn. The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .

[3] M. Fisher,et al. Dimer problem in statistical mechanics-an exact result , 1961 .

[4] C. L. Liu,et al. Introduction to Combinatorial Mathematics. , 1971 .

[5] H. Hosoya. Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons , 1971 .

[6] R. B. McQuistan,et al. Occupation Statistics for Parallel Dumbbells on a 2 × N Lattice Space , 1972 .

[7] Exact parastatistics for one‐dimensional lattice space , 1973 .

[8] Occupation statistics from exact recursion relations for occupation by dumbbells of a 2 × N array , 1974 .

[9] R. Grimson,et al. Exact formulas for 2 × n arrays of dumbbells , 1974 .

[10] Ivan Gutman,et al. A topological index for the totalπ-electron energy , 1975 .