The number of matchings of low order in hexagonal systems

Diego Klabjan*, B. Mohar

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

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 languageEnglish (US)
Pages (from-to)167-175
Number of pages9
JournalDiscrete Mathematics
Volume186
Issue number1-3
DOIs
StatePublished - May 15 1998

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'The number of matchings of low order in hexagonal systems'. Together they form a unique fingerprint.

Cite this