Enumeration of matchings in families of self-similar graphs

DOI10.1016/j.dam.2010.05.006zbMath1215.05087OpenAlexW2087781587MaRDI QIDQ608260

Elmar Teufl, Stephan G. Wagner

Publication date: 25 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.006

zbMATH Keywords

asymptotic enumerationmatchingsself-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 (7)

The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs ⋮ Counting dimer coverings on self-similar Schreier graphs ⋮ Using edge generating function to solve monomer-dimer problem ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ On the number of independent sets in cycle-separated tricyclic graphs ⋮ Feedback vertex number of Sierpiński-type graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees on the Sierpinski gasket
• Dimer coverings on the Sierpinski gasket
• An asymptotic independence theorem for the number of matchings in graphs
• The number of matchings in random regular graphs and bipartite graphs
• The difference Laplacian \(\Delta\) on the modified Koch curve
• On acyclic systems with minimal Hosoya index
• The tower of Hanoi
• Enumeration problems for classes of self-similar graphs
• Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
• Theory of monomer-dimer systems
• On the theory of the matching polynomial
• A Note on the Theory of Moment Generating Functions

This page was built for publication: Enumeration of matchings in families of self-similar graphs