Enumeration of spanning trees of graphs with rotational symmetry

DOI10.1016/J.JCTA.2010.12.007MaRDI QIDQ2431603zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Laplacian matrixadjacency matrixspanning treematrix-tree theorem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30)

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

Cites work

• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3461953 (Why is no real title available?)
• A new 5‐arc‐transitive cubic graph
• An exploration of the permanent-determinant method
• Asymptotic Enumeration of Spanning Trees
• Characteristic polynomials of graph coverings
• DIMERS ON TWO-DIMENSIONAL LATTICES
• Enumerating spanning trees of graphs with an involution
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
• Graph theory
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• On the entropy of spanning trees on a large triangular lattice
• Perfect matchings and perfect squares
• Some exact results for spanning trees on lattices
• Spanning trees on graphs and lattices inddimensions
• Spanning trees on hypercubic lattices and nonorientable surfaces
• Spanning trees on lattices and integral identities
• Spanning trees on the Sierpinski gasket
• The number of spanning trees of plane graphs with reflective symmetry
• Trees and matchings

Cited in

(13)

• Spanning trees and recurrent configurations of a graph
• Dimers on the 3³ . 4² lattice
• The spectrum and Laplacian spectrum of the dice lattice
• Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
• 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)