A bound for the complexity of a simple graph

DOI10.1016/0012-365X(88)90182-3zbMath0645.05030WikidataQ126594505 ScholiaQ126594505MaRDI QIDQ1102975

Russell Merris, Robert D. Grone

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning treescomplexity of a graph

Mathematics Subject Classification ID

Trees (05C05)

Related Items (14)

On the likelihood of forests ⋮ Graph complexity and the laplacian matrix in blocked experiments ⋮ Applications of multlinear algebra ⋮ Upper bounds for the number of spanning trees of graphs ⋮ The number of bounded‐degree spanning trees ⋮ On the geometry and Laplacian of a graph ⋮ Spanning trees: A survey ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ On the form factor for the unitary group ⋮ A sharp upper bound for the number of spanning trees of a graph ⋮ The number of spanning trees of a graph with given matching number ⋮ The number of spanning trees of a graph ⋮ Tree and forest weights and their application to nonuniform random graphs ⋮ The minimum number of spanning trees in regular multigraphs

Cites Work

• Unnamed Item
• Spanning trees in regular graphs
• A Fischer inequality for the second immanant
• An upper bound for the number of spanning trees of a graph
• An inequality for the second immanant

This page was built for publication: A bound for the complexity of a simple graph