Enumerating spanning trees of graphs with an involution

DOI10.1016/j.jcta.2008.10.004zbMath1228.05177OpenAlexW2021769035MaRDI QIDQ1024367

Weigen Yan, Fu Ji Zhang

Publication date: 17 June 2009

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

zbMATH Keywords

spanning treeLaplacian eigenvalueLaplacian matrixinvolutionmatrix-tree theorem

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (20)

The spectrum and Laplacian spectrum of the dice lattice ⋮ Resistance distances and Kirchhoff index of graphs with an involution ⋮ Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons ⋮ A type of generalized mesh-star transformation and applications in electrical networks ⋮ The triangular kagomé lattices revisited ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest ⋮ Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs ⋮ Counting spanning trees with a Kekulé structure in linear hexagonal chains ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ Enumeration of spanning trees of graphs with rotational symmetry ⋮ Unnamed Item ⋮ Critical groups of graphs with reflective symmetry ⋮ Critical groups of graphs with dihedral actions ⋮ Some physical and chemical indices of the Union Jack lattice ⋮ Effective resistances and spanning trees in the complete bipartite graph plus a matching ⋮ The number of spanning trees of a family of 2-separable weighted graphs ⋮ The enumeration of spanning tree of weighted graphs ⋮ Counting spanning trees in almost complete multipartite graphs ⋮ Spanning trees and dimer problem on the Cairo pentagonal lattice

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
• On \(k\)-pairable graphs
• Trees and matchings
• The number of spanning trees of plane graphs with reflective symmetry
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• New Tricks for Old Trees: Maps and the Pigeonhole Principle
• Spanning trees on graphs and lattices inddimensions
• Some exact results for spanning trees on lattices
• A new 5‐arc‐transitive cubic graph
• Enumeration of perfect matchings in graphs with reflective symmetry

This page was built for publication: Enumerating spanning trees of graphs with an involution