Enumerating spanning trees of graphs with an involution
type: Item
instance of: scholarly article
title: Enumerating spanning trees of graphs with an involution
zbMATH Open document ID: 1228.05177
author: Weigen Yan
author: Fuji Zhang
published in: Journal of Combinatorial Theory. Series A
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5565610
zbMATH Keywords: involution
zbMATH Keywords: spanning tree
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: matrix-tree theorem
zbMATH Keywords: Laplacian eigenvalue
MaRDI profile type: Publication
full work available at URL: j.jcta.2008.10.004
OpenAlex ID: W2021769035
cites work: A new 5‐arc‐transitive cubic graph
cites work: Q5422499
cites work: Some exact results for spanning trees on lattices
cites work: On \(k\)-pairable graphs
cites work: Enumeration of perfect matchings in graphs with reflective symmetry
cites work: The number of spanning trees of plane graphs with reflective symmetry
cites work: New Tricks for Old Trees: Maps and the Pigeonhole Principle
cites work: Trees and matchings
cites work: Spanning trees on graphs and lattices inddimensions
cites work: Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
cites work: Enumeration of perfect matchings of a type of Cartesian products of graphs
cites work: Q3140234
DOI: 10.1016/J.JCTA.2008.10.004
description: scientific article; zbMATH DE number 5565610