On the characterization of graphs with maximum number of spanning trees

DOI10.1016/S0012-365X(97)00034-4zbMath0895.05052MaRDI QIDQ1377718

Louis Petingi, Charles L. Suffel, F. T. Boesch

Publication date: 14 September 1998

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

zbMATH Keywords

spanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• Comparison of graphs by their number of spanning trees
• Laplacian matrices of graphs: A survey
• Parallel concepts in graph theory
• A certain polynomial of a graph and graphs with an extremal number of trees
• Maximizing the number of spanning trees in a graph with n nodes and m edges
• A proof of Boesch's conjecture
• On the existence of uniformly optimally reliable networks

Related Items (20)

On family of graphs with minimum number of spanning trees ⋮ On numbers of vertices of maximum degree in the spanning trees of a graph ⋮ Computing exact \(D\)-optimal designs by mixed integer second-order cone programming ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ A generalization of Boesch's theorem ⋮ The number and degree distribution of spanning trees in the Tower of Hanoi graph ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model ⋮ The number of spanning trees in the composition graphs ⋮ Number of spanning trees of different products of complete and complete bipartite graphs ⋮ Spanning trees: A survey ⋮ Network reliability in Hamiltonian graphs ⋮ A survey of some network reliability analysis and synthesis results ⋮ Exactly \(k\) MSTs: How many vertices suffice? ⋮ The number of spanning trees for Sierpiński graphs and data center networks ⋮ Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs ⋮ Undirected simple connected graphs with minimum number of spanning trees ⋮ Unnamed Item ⋮ Classes of uniformly most reliable graphs for all-terminal reliability ⋮ Number of spanning trees in the sequence of some graphs

This page was built for publication: On the characterization of graphs with maximum number of spanning trees