LEGGETT BOUNDS FOR NETWORK RELIABILITY.

Daryl D. Harms; Charles J. Colbourn

doi:10.1109/tcs.1985.1085755

LEGGETT BOUNDS FOR NETWORK RELIABILITY.

Daryl D. Harms, Charles J. Colbourn

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	609-611
Number of pages	3
Journal	IEEE transactions on circuits and systems
Volume	CAS-32
Issue number	6
DOIs	https://doi.org/10.1109/tcs.1985.1085755
State	Published - 1985
Externally published	Yes

ASJC Scopus subject areas

General Engineering

Access to Document

10.1109/tcs.1985.1085755

Cite this

@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 Colbourn, {Charles J.}",

year = "1985",

doi = "10.1109/tcs.1985.1085755",

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

PY - 1985

Y1 - 1985

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

U2 - 10.1109/tcs.1985.1085755

DO - 10.1109/tcs.1985.1085755

M3 - Article

AN - SCOPUS:0022079991

SN - 0098-4094

VL - CAS-32

SP - 609

EP - 611

JO - IEEE transactions on circuits and systems

JF - IEEE transactions on circuits and systems

IS - 6

ER -

LEGGETT BOUNDS FOR NETWORK RELIABILITY.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this