The number of spanning trees of plane graphs with reflective symmetry

DOI10.1016/j.jcta.2005.01.007zbMath1072.05038OpenAlexW2009561896MaRDI QIDQ2568971

Mihai Ciucu, Weigen Yan, Fu Ji Zhang

Publication date: 17 October 2005

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.2005.01.007

zbMATH Keywords

symmetric graphperfect matchingmatrix-tree theoremdual graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The spectrum and Laplacian spectrum of the dice lattice ⋮ Resistance distances and Kirchhoff index of graphs with an involution ⋮ Resistance characterizations of equiarboreal graphs ⋮ The triangular kagomé lattices revisited ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ Enumeration of spanning trees of graphs with rotational symmetry ⋮ Chip-Firing Games and Critical Groups ⋮ Critical groups of graphs with reflective symmetry ⋮ Critical groups of graphs with dihedral actions ⋮ Some physical and chemical indices of the Union Jack lattice ⋮ Sandpiles and dominos ⋮ ALEXANDER POLYNOMIAL FOR EVEN GRAPHS WITH REFLECTIVE SYMMETRY ⋮ Enumerating spanning trees of graphs with an involution ⋮ Spanning trees and dimer problem on the Cairo pentagonal lattice

Cites Work

• Recent results in the theory of graph spectra
• Aztec diamonds, checkerboard graphs, and spanning trees
• The $Q$-spectrum and spanning trees of tensor products of bipartite graphs
• Spanning trees on graphs and lattices inddimensions
• Enumeration of perfect matchings in graphs with reflective symmetry
• Research problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item