LEGGETT BOUNDS FOR NETWORK RELIABILITY.

Daryl D. Harms, Charles J. Colbourn

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

In 1968, J. D. Leggett developed upper and lower bounds on the reliability polynomial of a network by exploiting graph-theoretical properties. Leggett's proposed bounds are better, for some networks, than the best available bounds in the literature due to Ball and Provan. The incorrectness of Leggett's bounds is established. Errors in the bounds on network reliability are shown to invalidate the bounds.

Original languageEnglish (US)
Pages (from-to)609-611
Number of pages3
JournalIEEE transactions on circuits and systems
VolumeCAS-32
Issue number6
StatePublished - Jun 1 1985
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'LEGGETT BOUNDS FOR NETWORK RELIABILITY.'. Together they form a unique fingerprint.

Cite this