LEGGETT BOUNDS FOR NETWORK RELIABILITY.

Daryl D. Harms, Charles Colbourn

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 1985
Externally publishedYes

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Engineering(all)

Cite this

LEGGETT BOUNDS FOR NETWORK RELIABILITY. / Harms, Daryl D.; Colbourn, Charles.

In: IEEE Transactions on Circuits and Systems, Vol. CAS-32, No. 6, 06.1985, p. 609-611.

Research output: Contribution to journalArticle

@article{16afda8795ab4f21ac053b07cab62837,
title = "LEGGETT BOUNDS FOR NETWORK RELIABILITY.",
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.",
author = "Harms, {Daryl D.} and Charles Colbourn",
year = "1985",
month = "6",
language = "English (US)",
volume = "CAS-32",
pages = "609--611",
journal = "IEEE Transactions on Circuits and Systems",
issn = "0098-4094",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - LEGGETT BOUNDS FOR NETWORK RELIABILITY.

AU - Harms, Daryl D.

AU - Colbourn, Charles

PY - 1985/6

Y1 - 1985/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022079991&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022079991&partnerID=8YFLogxK

M3 - Article

VL - CAS-32

SP - 609

EP - 611

JO - IEEE Transactions on Circuits and Systems

JF - IEEE Transactions on Circuits and Systems

SN - 0098-4094

IS - 6

ER -