Zeros Of Reliability Polynomials And F-Vectors Of Matroids

Abstract. For a nite multigraphG, the reliability function of G is the probability RG(q) that if each edge of G is deleted independently with probability q then the remaining edges of G induce a connected spanning subgraph of G; this is a polynomial function of q. In 1992, Brown and Colbourn conjectured that for any connected multigraph G, if q 2 C is such that RG(q) = 0 then

• Type: Journal
• Year: 2000
• Where: CPC
• Authors: David G. Wagner
• Keywords: Connected Spanning Subgraph, CPC 2000, Nite MultigraphG, Reliability Function