Study on the uniformly optimally reliable graphs for given classes of graph

zbMATH Open1157.05325MaRDI QIDQ5455895FDOQ5455895

Authors: Yongjun Du, Shengning Qiao, Zhihuai Yang 

Publication date: 4 April 2008

Recommendations

• scientific article; zbMATH DE number 5031207
• Some conjectured uniformly optimal reliable networks
• Classes of uniformly most reliable graphs for all-terminal reliability
• Uniformly optimally reliable graphs
• A proof of Boesch's conjecture

zbMATH Keywords

graphsnetwork reliability\(\tau\)-optimal graphunreliable polynomial

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Structural characterization of families of graphs (05C75)

Cited In (6)

• Classes of uniformly most reliable graphs for all-terminal reliability
• Uniformly optimal graphs in some classes of graphs with node failures
• Counterexamples to conjectures for uniformly optimally reliable graphs.
• Title not available (Why is that?)
• Uniformly optimally reliable graphs: A survey
• The optimal unicyclic graphs for pair-connected reliability

This page was built for publication: Study on the uniformly optimally reliable graphs for given classes of graph

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