The number of matchings of low order in hexagonal systems

DOI10.1016/S0012-365X(97)00163-5zbMath0957.05073MaRDI QIDQ1584286

Diego Klabjan, Bojan Mohar

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixhexagonal systemsnumber of \(k\)-matchings

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Computing the Number of Matchings in Catacondensed Benzenoid Systems ⋮ On the number of matchings of graphs formed by a graph operation ⋮ Closed formulas for the number of small paths, independent sets and matchings in fullerenes

Cites Work

• A linear algorithm for perfect matching in hexagonal systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of matchings of low order in hexagonal systems