Reliability polynomials can cross twice

Charles Colbourn, Daryl D. Harms, Wendy J. Myrvold

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

An example is given to demonstrate that all-terminal reliability polynomials of networks having the same number of nodes and the same number of links can cross twice as the edge operation probability ranges from 0 to 1. A similar result is shown for two-terminal reliability.

Original languageEnglish (US)
Pages (from-to)629-633
Number of pages5
JournalJournal of the Franklin Institute
Volume330
Issue number3
DOIs
StatePublished - 1993
Externally publishedYes

Fingerprint

Polynomials
Polynomial
Vertex of a graph
Range of data
Demonstrate
Node

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems and Management
  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Applied Mathematics
  • Control and Optimization
  • Modeling and Simulation

Cite this

Reliability polynomials can cross twice. / Colbourn, Charles; Harms, Daryl D.; Myrvold, Wendy J.

In: Journal of the Franklin Institute, Vol. 330, No. 3, 1993, p. 629-633.

Research output: Contribution to journalArticle

Colbourn, Charles ; Harms, Daryl D. ; Myrvold, Wendy J. / Reliability polynomials can cross twice. In: Journal of the Franklin Institute. 1993 ; Vol. 330, No. 3. pp. 629-633.
@article{b625548f44a3427f95f6ed5526adb71c,
title = "Reliability polynomials can cross twice",
abstract = "An example is given to demonstrate that all-terminal reliability polynomials of networks having the same number of nodes and the same number of links can cross twice as the edge operation probability ranges from 0 to 1. A similar result is shown for two-terminal reliability.",
author = "Charles Colbourn and Harms, {Daryl D.} and Myrvold, {Wendy J.}",
year = "1993",
doi = "10.1016/0016-0032(93)90102-Z",
language = "English (US)",
volume = "330",
pages = "629--633",
journal = "Journal of the Franklin Institute",
issn = "0016-0032",
publisher = "Elsevier Limited",
number = "3",

}

TY - JOUR

T1 - Reliability polynomials can cross twice

AU - Colbourn, Charles

AU - Harms, Daryl D.

AU - Myrvold, Wendy J.

PY - 1993

Y1 - 1993

N2 - An example is given to demonstrate that all-terminal reliability polynomials of networks having the same number of nodes and the same number of links can cross twice as the edge operation probability ranges from 0 to 1. A similar result is shown for two-terminal reliability.

AB - An example is given to demonstrate that all-terminal reliability polynomials of networks having the same number of nodes and the same number of links can cross twice as the edge operation probability ranges from 0 to 1. A similar result is shown for two-terminal reliability.

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

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

U2 - 10.1016/0016-0032(93)90102-Z

DO - 10.1016/0016-0032(93)90102-Z

M3 - Article

VL - 330

SP - 629

EP - 633

JO - Journal of the Franklin Institute

JF - Journal of the Franklin Institute

SN - 0016-0032

IS - 3

ER -