Uniformly-most reliable networks do not always exist

Boesch conjectured that there is always a uniformly‐most reliable graph on n points and e edges. We present an infinite family of counterexamples to this conjecture.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Networks 1991-07, Vol.21 (4), p.417-419
Hauptverfasser:	Myrvold, Wendy, Cheung, Kim H., Page, Lavon B., Perry, Jo Ellen
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Boesch conjectured that there is always a uniformly‐most reliable graph on n points and e edges. We present an infinite family of counterexamples to this conjecture.
ISSN:	0028-3045 1097-0037
DOI:	10.1002/net.3230210404