The number of spanning trees of a graph

DOI10.1016/J.AML.2009.10.006MaRDI QIDQ5897169zbMATH OpenOpenAlexFDO

Authors Wai Chee Shiu, An Chang, Jianxi Li

Publication date 12 February 2010

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2009.10.006

zbMATH Keywords

enumerationnumber of spanning treesupper bound

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Enumeration in graph theory (05C30)

Recommendations

• On the upper bound for the number of spanning trees of a connected graph
• The number of spanning trees of a graph
• scientific article; zbMATH DE number 1161331
• A sharp upper bound for the number of spanning trees of a graph
• Sharp upper bounds for the number of spanning trees of a graph

Cites work

• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• A sharp upper bound for the number of spanning trees of a graph
• An upper bound for the number of spanning trees of a graph
• Graph theory with applications
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 2075777 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Laplacian graph eigenvectors
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• Sharp upper bounds for the number of spanning trees of a graph
• The Laplacian Spectrum of a Graph II

Cited in

(27)

• The number of spanning forests of a graph
• The maximum number of spanning trees of a graph with given matching number
• The coefficients of Laplacian characteristic polynomials of graphs
• A sharp upper bound for the number of spanning trees of a graph
• The bridge number of arborescent links with many twigs
• On the upper bound for the number of spanning trees of a connected graph
• A formula for the number of spanning trees of a multi-star related graph
• scientific article; zbMATH DE number 2127724 (Why is no real title available?)
• The dynamics of the forest graph operator
• scientific article; zbMATH DE number 5305008 (Why is no real title available?)
• scientific article; zbMATH DE number 3987294 (Why is no real title available?)
• scientific article; zbMATH DE number 4093483 (Why is no real title available?)
• Upper bounds for the number of spanning trees of graphs
• scientific article; zbMATH DE number 2014474 (Why is no real title available?)
• A simple formula for the number of spanning trees of line graphs
• scientific article; zbMATH DE number 1926055 (Why is no real title available?)
• The number of spanning trees of double graphs
• On the VC-dimension‎, ‎covering and separating properties of the cycle and spanning tree hypergraphs of graphs
• scientific article; zbMATH DE number 5584928 (Why is no real title available?)
• scientific article; zbMATH DE number 5497806 (Why is no real title available?)
• The number of spanning trees of a graph with given matching number
• The number of spanning trees of a graph
• The number of spanning trees in self-similar graphs
• Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs
• The number of odd spanning trees in the complete graphs
• Maximum number of spanning trees and connectivity: graphs with a fixed minimum degree and bipartite graphs
• Measures of information spread, spanning trees, and walks in regular graphs

This page was built for publication: The number of spanning trees of a graph

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