scientific article; zbMATH DE number 1161331

MaRDI QIDQ4393329zbMATH OpenFDO

Authors

Publication date 2 December 1998

zbMATH Keywords

Laplacian matrixspanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• A sharp upper bound for the number of spanning trees of a graph
• A bound for the complexity of a simple graph
• Sharp upper bounds for the number of spanning trees of a graph
• The number of spanning trees of a graph

Cited in

(13)

• A sharp upper bound for the number of spanning trees of a graph
• On the upper bound for the number of spanning trees of a connected graph
• The dynamics of the forest graph operator
• Sharp upper bounds for the number of spanning trees of a graph
• A lower bound on the number of spanning trees withk end-vertices
• Upper bounds for the number of spanning trees of graphs
• The number of spanning trees in graphs with a given degree sequence
• scientific article; zbMATH DE number 5174860 (Why is no real title available?)
• Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs
• 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 of a graph
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend

This page was built for publication:

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