Counterexamples to conjectures for uniformly optimally reliable graphs.

DOI10.1017/S0269964800142044MaRDI QIDQ2711573zbMATH OpenOpenAlexFDO

Authors Yontha Ath, Milton Sobel

Publication date 5 July 2001

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964800142044

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Uniformly optimally reliable graphs: A survey
• Uniformly optimally reliable graphs
• scientific article; zbMATH DE number 2077669
• Study on the uniformly optimally reliable graphs for given classes of graph
• On the nonexistence of uniformly optimal graphs for pair-connected reliability
• scientific article; zbMATH DE number 5031207
• On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
• Uniformly optimal digraphs for strongly connected reliability
• On the construction of optimally reliable graphs
• On uniformly most reliable complete multi-partite graphs

Cited in

(7)

• Uniformly optimal graphs in some classes of graphs with node failures
• Reliabilities for two kinds of graphs with smaller diameters
• Uniformly-most reliable networks do not always exist
• scientific article; zbMATH DE number 5031207 (Why is no real title available?)
• A simple proof of the Gross‐Saccoman multigraph conjecture
• Uniformly optimally reliable graphs: A survey
• Faithfulness in chain graphs: the discrete case

This page was built for publication: Counterexamples to conjectures for uniformly optimally reliable graphs.

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