An upper bound for the number of spanning trees of a graph

DOI10.1016/S0012-365X(76)80005-2MaRDI QIDQ1234299zbMATH OpenOpenAlexFDO

Authors G. R. Grimmett

Publication date 1977

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(76)80005-2

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited in

(17)

• Upper bounds for the number of spanning trees of graphs
• A bound for the complexity of a simple graph
• Unions of random trees and applications
• Spanning trees: A survey
• Exact Potts model partition functions on wider arbitrary-length strips of the square lattice
• Tree and forest weights and their application to nonuniform random graphs
• The number of spanning trees of a graph
• The number of spanning trees of a graph
• Computational complexity of counting coincidences
• The number of spanning trees for Sierpiński graphs and data center networks
• The dynamics of the forest graph operator
• The number of spanning trees of a graph with given matching number
• Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs
• The maximum number of spanning trees of a graph with given matching number
• A sharp upper bound for the number of spanning trees of a graph
• The number of spanning forests of a graph
• On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs

This page was built for publication: An upper bound for 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 Q1234299)