On the upper bound for the number of spanning trees of a connected graph

MaRDI QIDQ2809949zbMATH OpenFDO

Authors Rao Li

Publication date 30 May 2016

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

Laplacian eigenvaluespanning tree

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Recommendations

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

Cited in

(7)

• The number of spanning trees of a graph with given matching number
• The number of spanning trees of double graphs
• A lower bound on the number of spanning trees withk end-vertices
• The number of spanning trees of a graph
• scientific article; zbMATH DE number 5174860 (Why is no real title available?)
• On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
• Upper bounds for the number of spanning trees of graphs

This page was built for publication: On the upper bound for the number of spanning trees of a connected graph

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