Exact and asymptotic enumeration of perfect matchings in self-similar graphs

DOI10.1016/j.disc.2009.07.009zbMath1228.05176OpenAlexW2132486055MaRDI QIDQ1045201

Stephan G. Wagner, Elmar Teufl

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.009

zbMATH Keywords

asymptoticsexact enumerationperfect matchingsself-similar graphs

Mathematics Subject Classification ID

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

Related Items (4)

Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ Counting dimer coverings on self-similar Schreier graphs ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ Maximum matchings in scale-free networks with identical degree distribution

Cites Work

• Unnamed Item
• Unnamed Item
• The number of spanning trees in self-similar graphs
• Dimer coverings on the Sierpinski gasket
• The number of trees with a 1-factor
• On convergence rates in the central limit theorems for combinatorial structures
• Enumeration problems for classes of self-similar graphs
• A Note on the Theory of Moment Generating Functions

This page was built for publication: Exact and asymptotic enumeration of perfect matchings in self-similar graphs