论文信息 - The number of matchings of low order in hexagonal systems

The number of matchings of low order in hexagonal systems

Abstract A simple way to calculate the number of k -matchings, k ⩽ 5, in hexagonal systems is presented. Some relations between the coefficients of the characteristic polynomial of the adjacency matrix of a hexagonal system and the number of matchings are obtained.

Diego Klabjan | Bojan Mohar | B. Mohar | D. Klabjan

[1] Peter E. John,et al. Counting perfect matchings in polyominoes with an application to the dimer problem , 1987 .

[2] Pierre Hansen,et al. A linear algorithm for perfect matching in hexagonal systems , 1993, Discret. Math..

[3] Rainer Bodendiek,et al. Topics In Combinatorics and Graph Theory , 1992 .

[4] Michael Doob,et al. Spectra of graphs , 1980 .

[5] Horst Sachs,et al. Counting Perfect Matchings in Lattice Graphs , 1990 .

[6] Ivan Gutman,et al. Topological properties of benzenoid systems , 1977 .

[7] Rainer Bodendiek,et al. Contemporary methods in graph theory , 1990 .