Bounds for All-Terminal Reliability in Planar Networks

Aparna Ramesh, Michael O. Ball, Charles J. Colbourn

Research output: Contribution to journalArticle

Abstract

A communication network can be modeled as a graph where the nodes of the graph represent the sites, and the edges represent the links between the sites. The edges of the graph operate with equal probability p. The all-terminal reliability of the network with n nodes and b edges can be written as where Fiis the number of connected subgraphs with (b - i) edges and q= (1 -p). All known subgraph counting bounds for R use exact values for F0, …, Fcand Fdwhere c is the cardinality of a minimum cut and d=b - n + 1. In this paper we derive upper and lower bounds for R for planar networks by using exact values of Fd-1, Fd-2, Fd-3, Fc+1and Fc+2where approximations were used before. The effect of using these exact values instead of approximations on Kruskal-Katona bounds and Ball-Provan bounds is studied.

Original languageEnglish (US)
Pages (from-to)261-273
Number of pages13
JournalNorth-Holland Mathematics Studies
Volume144
Issue numberC
DOIs
StatePublished - Jan 1987
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Bounds for All-Terminal Reliability in Planar Networks'. Together they form a unique fingerprint.

  • Cite this