Building uniformly most-reliable networks by iterative augmentation

A fundamental problem in network reliability analysis is to find the connectedness probability of a random graph, subject to perfect nodes and link failures. If, in addition, we consider independent link failures with identical probability ρ, the connectedness probability is known as the all-terminal reliability. It is well-known that the all-terminal reliability is a polynomial in the variable ρ ∊ [0,1], and its determination belongs to the class of NP-Hard problems. In this paper we address the following network design problem: given a fixed number of nodes and links p and q, find the graph that maximizes the reliability polynomial uniformly on the compact set ρ ∊ [0,1] for all (p, q)-graphs whenever it exists. These graphs are called uniformly most-reliable graphs. There exists easy graphs, where the reliability polynomial is obtained in a straightforward manner. The interplay between easy graphs and uniformly most-reliable graphs is first studied. Then, Wagner graph is discovered as a uniformly most-reliable graph, inspired by greedy augmentations of a cycle. The paper is closed with a conjecture on the existence of (n, n + 4) uniformly most-reliable graphs.

[1]  Ching-Shui Cheng,et al.  Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory , 1981, J. Comb. Theory B.

[2]  Frans C. Bussemaker,et al.  Cubic graphs on <=14 vertices , 1977, J. Comb. Theory, Ser. B.

[3]  Wendy Myrvold,et al.  Uniformly-most reliable networks do not always exist , 1991, Networks.

[4]  Appajosyula Satyanarayana,et al.  A survey of some network reliability analysis and synthesis results , 2009, Networks.

[5]  Douglas Bauer,et al.  Combinatorial optimization problems in the analysis and design of probabilistic networks , 1985, Networks.

[6]  Xiaoming Li,et al.  On the existence of uniformly optimally reliable networks , 1991, Networks.

[7]  R. V. Slyke,et al.  On the validity of a reduction of reliable network design to a graph extremal problem , 1987 .

[8]  D. A. Holton,et al.  The Petersen Graph: Symmetry , 1993 .

[9]  Eduardo Alberto Canale,et al.  Network utility problem and easy reliability polynomials , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).

[10]  Charles J. Colbourn.  Reliability Issues In Telecommunications Network Planning , 1999 .

[11]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[12]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[13]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[14]  Guifang Wang.  A proof of Boesch's conjecture , 1994, Networks.

[15]  Clyde L. Monma,et al.  Minimum-weight two-connected spanning networks , 1990, Math. Program..

[16]  Eduardo Alberto Canale,et al.  Diameter-Constrained Reliability: Complexity, Factorization and Exact computation in Weak Graphs , 2014, LANC.

[17]  B. Mahjani.  Exploring connectivity of random subgraphs of a graph , 2010, 1008.4814.

[18]  F. Harary.  THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[19]  L. Beineke,et al.  Topics in Structural Graph Theory , 2013 .

[20]  Charles L. Suffel,et al.  On the characterization of graphs with maximum number of spanning trees , 1998, Discret. Math..