Non-Stanley bounds for network reliability

Jason I. Brown, Charles J. Colbourn

Research output: Contribution to journalArticle

14 Scopus citations

Abstract

Suppose that each edge of a connected graph G of order n is independently operational with probability p; the reliability of G is the probability that the operational edges form a spanning connected subgraph. A useful expansion of the reliability is as pn-1i=0d Hi(1 - p)i, and the Ball-Provan method for bounding reliability relies on Stanley's combinatorial bounds for the H-vectors of shellable complexes. We prove some new bounds here for the H-vectors arising from graphs, and the results here shed light on the problem of characterizing the H-vectors of matroids.

Original languageEnglish (US)
Pages (from-to)13-36
Number of pages24
JournalJournal of Algebraic Combinatorics
Volume5
Issue number1
DOIs
StatePublished - Jan 1 1996

Keywords

  • Graph polynomial
  • H-vector
  • Matroid
  • Network reliability
  • Shellable complex

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Non-Stanley bounds for network reliability'. Together they form a unique fingerprint.

  • Cite this