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

zbMATH Open1342.05024MaRDI QIDQ2809949FDOQ2809949

Authors: Rao Li 

Publication date: 30 May 2016

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

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

zbMATH Keywords

Laplacian eigenvaluespanning tree

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Cited In (7)

• Upper bounds for the number of spanning trees of graphs
• Title not available (Why is that?)
• The number of spanning trees of double graphs
• The number of spanning trees of a graph
• A lower bound on the number of spanning trees withk end-vertices
• The number of spanning trees of a graph with given matching number
• On the Minimum Number of Spanning Trees ink-Edge-Connected 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)