Enumeration of spanning trees of graphs with rotational symmetry
From MaRDI portal
Publication:2431603
DOI10.1016/j.jcta.2010.12.007zbMath1231.05130OpenAlexW2021448972MaRDI QIDQ2431603
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
Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (9)
Dimers on the \(3^3 . 4^2\) lattice ⋮ The spectrum and Laplacian spectrum of the dice lattice ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ Critical groups of graphs with dihedral actions ⋮ Some physical and chemical indices of the Union Jack lattice ⋮ Spanning trees and recurrent configurations of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Spanning trees on the Sierpinski gasket
- Enumerating spanning trees of graphs with an involution
- An exploration of the permanent-determinant method
- Perfect matchings and perfect squares
- Spanning trees on hypercubic lattices and nonorientable surfaces
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- Trees and matchings
- The number of spanning trees of plane graphs with reflective symmetry
- On the entropy of spanning trees on a large triangular lattice
- DIMERS ON TWO-DIMENSIONAL LATTICES
- Characteristic polynomials of graph coverings
- Spanning trees on graphs and lattices inddimensions
- Some exact results for spanning trees on lattices
- Spanning trees on lattices and integral identities
- Asymptotic Enumeration of Spanning Trees
- A new 5‐arc‐transitive cubic graph
This page was built for publication: Enumeration of spanning trees of graphs with rotational symmetry