Maximizing the number of spanning trees in a graph with n nodes and m edges

DOI10.6028/JRES.078B.023zbMATH Open0295.05115OpenAlexW2328755268MaRDI QIDQ4047568FDOQ4047568

Authors: Douglas R. Shier 

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

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cited In (12)

• A generalization of Boesch's theorem
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• A survey of some network reliability analysis and synthesis results
• Graphs with the maximum or minimum number of 1-factors
• On the characterization of graphs with maximum number of spanning trees
• Exactly \(k\) MSTs: How many vertices suffice?
• Finding the graph with the maximum number of spanning trees
• Do nearly balanced multigraphs have more spanning trees?
• Extremal graphs for the Tutte polynomial
• D-optimal block designs with at most six varieties
• Uniformly optimally reliable graphs: A survey
• A reliability-improving graph transformation with applications to network reliability

This page was built for publication: Maximizing the number of spanning trees in a graph with n nodes and m edges

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