Enumerating spanning trees of graphs with an involution

DOI10.1016/J.JCTA.2008.10.004zbMATH Open1228.05177OpenAlexW2021769035MaRDI QIDQ1024367FDOQ1024367

Weigen Yan, Fuji 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

Laplacian matrixinvolutionLaplacian eigenvaluespanning treematrix-tree theorem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (22)

• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• Counting spanning trees in almost complete multipartite graphs
• Spanning trees and dimer problem on the Cairo pentagonal lattice
• Title not available (Why is that?)
• Factorizations of some weighted spanning tree enumerators
• The enumeration of spanning tree of weighted graphs
• Enumeration of trees by inversions
• The triangular kagomé lattices revisited
• The number of spanning trees of a family of 2-separable weighted graphs
• The spectrum and Laplacian spectrum of the dice lattice
• Critical groups of graphs with dihedral actions
• Counting spanning trees of \((1, N\))-periodic graphs
• Critical groups of graphs with reflective symmetry
• Resistance distances and Kirchhoff index of graphs with an involution
• A type of generalized mesh-star transformation and applications in electrical networks
• Effective resistances and spanning trees in the complete bipartite graph plus a matching
• 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 spanning trees with a Kekulé structure in linear hexagonal chains
• Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• Enumeration of spanning trees of graphs with rotational symmetry

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024367)