A generalization of Boesch's theorem

DOI10.1016/j.disc.2011.12.001zbMath1235.90055OpenAlexW1967587966MaRDI QIDQ409456

Maolin Hu, Yongxi Cheng, Weidong Xu

Publication date: 13 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.001

zbMATH Keywords

network reliabilityspanning trees\(t\)-optimal graphsBoesch's theorem

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• Parallel concepts in graph theory
• A new technique for the characterization of graphs with a maximum number of spanning trees
• On the characterization of graphs with maximum number of spanning trees
• 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
• Maximizing spanning trees in almost complete graphs
• On the existence of uniformly optimally reliable networks

This page was built for publication: A generalization of Boesch's theorem