Enumeration of maximum matchings in the Hanoi graphs using matching polynomials

DOI10.1142/S1793830922501609MaRDI QIDQ6059080zbMATHOpenAlexWikidataFDO

Authors Žana Kovijanić Vukićević

Publication date 2 November 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830922501609

zbMATH Keywords

Hanoi graphsmatching numbermatching polynomialssystem of recursive relations

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
• scientific article; zbMATH DE number 5952364
• Maximal matchings in polyspiro and benzenoid chains
• Counting matchings in graphs
• Counting maximal matchings in linear polymers

Cites work

• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• Chain hexagonal cacti: matchings and independent sets
• Dimer–monomer model on the Towers of Hanoi graphs
• Matching theory
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
• The tower of Hanoi
• Theory of monomer-dimer systems

Cited in

(1)

• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs

This page was built for publication: Enumeration of maximum matchings in the Hanoi graphs using matching polynomials

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