Matching polynomials of regular chain-type graphs

DOI10.46793/MATCH.95-3.17725MaRDI QIDQ6880219zbMATH OpenFDO

Authors Hatice Çoban Eroğlu, K. Ilgar Eroğlu

Publication date 19 December 2025

Published in MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46793/MATCH.95-3.17725

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites work

• An introduction to matching polynomials
• Computing the matching and independence polynomials of double hexagonal chains
• Computing the number of \(k\)-matchings in benzenoid chains
• Computing the number of matchings in catacondensed benzenoid systems
• Dimer coverings on the Sierpinski gasket
• Dimer–monomer model on the Towers of Hanoi graphs
• Enumerating k-matchings in cyclic chains using the transfer matrix technique
• Enumeration problems for classes of self-similar graphs
• Hosoya index of thorny polymers
• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• scientific article; zbMATH DE number 3747179 (Why is no real title available?)
• Matching theory
• The Complexity of Enumeration and Reliability Problems

Cited in

(1)

• Matching polynomials of the Sierpinski gasket graphs

This page was built for publication: Matching polynomials of regular chain-type graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880219)