A new technique for the characterization of graphs with a maximum number of spanning trees

DOI10.1016/S0012-365X(01)00095-4zbMath0993.05119OpenAlexW2077157637MaRDI QIDQ1349105

O. Diekmann

Publication date: 21 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00095-4

zbMATH Keywords

characterizationsdegree sequencespanning treesmultipartite graphs\(t\)-optimal graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (17)

On family of graphs with minimum number of spanning trees ⋮ Heuristic maximization of the number of spanning trees in regular graphs ⋮ Extremal graphs for the Tutte polynomial ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ A generalization of Boesch's theorem ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model ⋮ Counting spanning trees using modular decomposition ⋮ Construction of efficient experimental designs under multiple resource constraints ⋮ Spanning trees: A survey ⋮ Graphs with the maximum or minimum number of 1-factors ⋮ A survey of some network reliability analysis and synthesis results ⋮ On the minimum number of spanning trees in cubic multigraphs ⋮ Counting Spanning Trees in Graphs Using Modular Decomposition ⋮ Undirected simple connected graphs with minimum number of spanning trees ⋮ Unnamed Item ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs

This page was built for publication: A new technique for the characterization of graphs with a maximum number of spanning trees