Maximizing the number of spanning trees in a graph with n nodes and m edges
From MaRDI portal
Publication:4047568
DOI10.6028/jres.078B.023zbMath0295.05115OpenAlexW2328755268MaRDI QIDQ4047568
Publication date: 1974
Published in: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.6028/jres.078b.023
Related Items (11)
Do nearly balanced multigraphs have more spanning trees? ⋮ A reliability-improving graph transformation with applications to network reliability ⋮ On the characterization of graphs with maximum number of spanning trees ⋮ Extremal graphs for the Tutte polynomial ⋮ Uniformly optimally reliable graphs: A survey ⋮ A generalization of Boesch's theorem ⋮ Finding the graph with the maximum number of spanning trees ⋮ Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory ⋮ D-optimal block designs with at most six varieties ⋮ Graphs with the maximum or minimum number of 1-factors ⋮ A survey of some network reliability analysis and synthesis results
This page was built for publication: Maximizing the number of spanning trees in a graph with n nodes and m edges
