Exact and asymptotic enumeration of perfect matchings in self-similar graphs
From MaRDI portal
Publication:1045201
DOI10.1016/J.DISC.2009.07.009zbMATH Open1228.05176OpenAlexW2132486055MaRDI QIDQ1045201FDOQ1045201
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
Recommendations
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On convergence rates in the central limit theorems for combinatorial structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumeration problems for classes of self-similar graphs
- A Note on the Theory of Moment Generating Functions
- Dimer coverings on the Sierpinski gasket
- The number of spanning trees in self-similar graphs
- The number of trees with a 1-factor
Cited In (9)
- 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
- Title not available (Why is that?)
- Enumeration problems for classes of self-similar graphs
- Maximum matchings in scale-free networks with identical degree distribution
- Connectivity and some other properties of generalized Sierpiński graphs
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)
