A generalization of Boesch's theorem

DOI10.1016/J.DISC.2011.12.001zbMATH Open1235.90055OpenAlexW1967587966MaRDI QIDQ409456FDOQ409456

Authors: 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

spanning treesnetwork reliability\(t\)-optimal graphsBoesch's theorem

Mathematics Subject Classification ID

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

Cites Work

• A new technique for the characterization of graphs with a maximum number of spanning trees
• Title not available (Why is that?)
• Parallel concepts in graph theory
• A certain polynomial of a graph and graphs with an extremal number of trees
• Title not available (Why is that?)
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• On the characterization of graphs with maximum number of spanning 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
• Title not available (Why is that?)
• On the existence of uniformly optimally reliable networks

Cited In (1)

• A Bochner theorem and applications

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

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