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.
Original language | English (US) |
---|---|
Pages (from-to) | 167-175 |
Number of pages | 9 |
Journal | Discrete Mathematics |
Volume | 186 |
Issue number | 1-3 |
DOIs | |
State | Published - May 15 1998 |
Funding
* Correspondence address: Klabjan Diego, School of Mathematics, Georgia Institute of Technology, Atlanta, GA, 30332-0160. 1 Supported in part by the Ministry of Science and Technology of Slovenia.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics