Enumeration of spanning trees of graphs with rotational symmetry
From MaRDI portal
Publication:2431603
DOI10.1016/J.JCTA.2010.12.007zbMATH Open1231.05130OpenAlexW2021448972MaRDI QIDQ2431603FDOQ2431603
Authors: Weigen Yan, Fuji Zhang 
Publication date: 15 April 2011
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.2010.12.007
Recommendations
- Circulant blocks and rotational graphs
- The number of spanning trees of plane graphs with reflective symmetry
- The asymptotic number of spanning trees in circulant graphs (extended abstract)
- Asymptotic Enumeration of Spanning Trees
- Asymptotic enumeration theorem for the number of spanning trees in grids and tori
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic Enumeration of Spanning Trees
- Spanning trees on graphs and lattices inddimensions
- Spanning trees on the Sierpinski gasket
- Enumerating spanning trees of graphs with an involution
- Spanning trees on hypercubic lattices and nonorientable surfaces
- The number of spanning trees of plane graphs with reflective symmetry
- DIMERS ON TWO-DIMENSIONAL LATTICES
- Some exact results for spanning trees on lattices
- Spanning trees on lattices and integral identities
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- A new 5‐arc‐transitive cubic graph
- Trees and matchings
- An exploration of the permanent-determinant method
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- Perfect matchings and perfect squares
- Characteristic polynomials of graph coverings
- Title not available (Why is that?)
- On the entropy of spanning trees on a large triangular lattice
Cited In (13)
- Spanning trees and recurrent configurations of a graph
- Dimers on the \(3^3 . 4^2\) lattice
- Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
- The spectrum and Laplacian spectrum of the dice lattice
- Critical groups of graphs with dihedral actions
- Counting spanning trees of \((1, N\))-periodic graphs
- On two conjectures concerning spanning tree edge dependences of graphs
- Enumerating spanning trees of graphs with an involution
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
- Some physical and chemical indices of the Union Jack lattice
- Counting rooted spanning forests for circulant foliation over a graph
- Resistance distances in generalized join graphs
- The number of spanning trees of plane graphs with reflective symmetry
This page was built for publication: Enumeration of spanning trees of graphs with rotational symmetry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431603)
