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

DOI10.1016/J.DISC.2009.07.009MaRDI QIDQ1045201zbMATH OpenOpenAlexFDO

Authors Elmar Teufl, Stephan Wagner

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

asymptoticsperfect matchingsexact enumerationself-similar graphs

Mathematics Subject Classification ID

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

Recommendations

• Enumeration of matchings in families of self-similar graphs
• Enumeration problems for classes of self-similar graphs
• The enumeration of perfect matchings in two types of graphs
• scientific article; zbMATH DE number 5952364
• Recurrence calculation of the perfect matchings number of two types of graphs

Cites work

• scientific article; zbMATH DE number 1405497 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• A Note on the Theory of Moment Generating Functions
• Dimer coverings on the Sierpinski gasket
• Enumeration problems for classes of self-similar graphs
• On convergence rates in the central limit theorems for combinatorial structures
• The number of spanning trees in self-similar graphs
• The number of trees with a 1-factor

Cited in

(9)

• Connectivity and some other properties of generalized Sierpiński graphs
• A direct encoding of Stoimenow's matchings as ascent sequences
• Counting dimer coverings on self-similar Schreier graphs
• Enumeration of matchings in families of self-similar graphs
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
• Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
• scientific article; zbMATH DE number 2099352 (Why is no real title available?)
• Enumeration problems for classes of self-similar graphs
• Maximum matchings in scale-free networks with identical degree distribution

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

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