Enumeration problems for classes of self-similar graphs
DOI10.1016/J.JCTA.2007.01.007zbMATH Open1124.05046OpenAlexW2153120082MaRDI QIDQ2384571FDOQ2384571
Authors: Elmar Teufl, Stephan Wagner 
Publication date: 10 October 2007
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.01.007
Recommendations
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs
- Enumeration of matchings in families of self-similar graphs
- Asymptotic enumeration on self-similar graphs with two boundary vertices
- A general method for computing Tutte polynomials of self-similar graphs
- The number of spanning trees in self-similar graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Random Walks on Infinite Graphs and Groups
- On subtrees of trees
- Analysis on fractals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Number of Independent Sets in a Grid Graph
- On the spectrum of Hecke type operators related to some fractal groups
- Spectral properties of self-similar lattices and iteration of rational maps
- Title not available (Why is that?)
- Random walks on trees with finitely many cone types
- Asymptotics of the transition probabilities of the simple random walk on self-similar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Twelve countings with rooted plane trees
- The number of matchings in random regular graphs and bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On maximal independent sets of nodes in trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting matchings in graphs
- Random walk statistics on fractal structures
- Growth of Self‐Similar Graphs
- Pure point spectrum of the Laplacians on fractal graphs
- Green functions on self-similar graphs and bounds for the spectrum of the Laplacian
- Listing and Counting Subtrees of a Tree
- Fractals in Graz 2001. Analysis, dynamics, geometry, stochastics. Proceedings of the conference, Graz, Austria, June 2001
- Title not available (Why is that?)
Cited In (18)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph
- Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket
- Enumerations of vertex orders of almost Moore digraphs with selfrepeats
- A connection between discrete and regularized Laplacian determinants on fractals
- K-Narayana sequence self-similarity. Flip graph views of k-Narayana self-similarity
- Asymptotic enumeration on self-similar graphs with two boundary vertices
- Using edge generating function to solve monomer-dimer problem
- Traversal languages capturing isomorphism classes of Sierpiński gaskets
- Counting dimer coverings on self-similar Schreier graphs
- Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao
- Enumeration of matchings in families of self-similar graphs
- Copy-paste trees and their growth rates
- Exact and asymptotic enumeration of perfect matchings in self-similar graphs
- An asymptotic independence theorem for the number of matchings in graphs
- The number of spanning trees in self-similar graphs
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
- The Tutte polynomial of a class of compound graphs and its applications
- Resistance scaling and the number of spanning trees in self-similar lattices
Uses Software
This page was built for publication: Enumeration problems for classes of self-similar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384571)
