A generalization of Boesch's theorem

DOI10.1016/J.DISC.2011.12.001MaRDI QIDQ409456zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 932184 (Why is no real title available?)
• scientific article; zbMATH DE number 1439503 (Why is no real title available?)
• A certain polynomial of a graph and graphs with an extremal number of trees
• A new technique for the characterization of graphs with a maximum number of spanning trees
• A proof of Boesch's conjecture
• Maximizing spanning trees in almost complete graphs
• Maximizing the number of spanning trees in a graph with n nodes and m edges
• 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
• On the existence of uniformly optimally reliable networks
• Parallel concepts in graph theory

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)