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 language||English (US)|
|Number of pages||3|
|Journal||IEEE transactions on circuits and systems|
|State||Published - Jun 1 1985|
ASJC Scopus subject areas