Network reliability in hamiltonian graphs

The reliability polynomial of a graph gives the probability that a graph remains operational when all its edges could fail independently with a certain fixed probability. In general, the problem of finding uniformly most reliable graphs inside a family of graphs, that is, one graph whose reliability is at least as large as any other graph inside the family, is very difficult. In this paper, we study this problem in the family of graphs containing a hamiltonian cycle.

[1]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[2]  A. Kelmans,et al.  A certain polynomial of a graph and graphs with an extremal number of trees , 1974 .

[3]  Pablo Romero,et al.  Building Reliability-Improving Network Transformations , 2019, 2019 15th International Conference on the Design of Reliable Communication Networks (DRCN).

[4]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[5]  Bülent Yener.  Virtual embeddings on regular topology networks , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[6]  Jason I. Brown,et al.  Uniformly optimal digraphs for strongly connected reliability , 2007, Networks.

[7]  Vincent Conitzer,et al.  Handbook of Computational Social Choice , 2016 .

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

[9]  Lynne L. Doty,et al.  On the construction of optimally reliable graphs , 1990, Networks.

[10]  Richard Ehrenborg,et al.  The average reliability of a graph , 2014, Discret. Appl. Math..

[11]  Charles L. Suffel,et al.  Spanning Tree Results For Graphs And Multigraphs: A Matrix-Theoretic Approach , 2014 .

[12]  John T. Saccoman,et al.  Uniformly optimally reliable graphs , 1998 .

[13]  F. T. Boesch.  On the synthesis of optimally reliable networks having unreliable nodes but reliable edges , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

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

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

[16]  Eduardo Alberto Canale,et al.  A Hybrid GRASP/VND Heuristic for the Design of Highly Reliable Networks , 2019, HM.

[17]  Jacek Rak,et al.  Future research directions in design of reliable communication systems , 2015, Telecommunication Systems.

[18]  A. Kelmans.  On graphs with randomly deleted edges , 1981 .

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

[20]  Hebert Pérez-Rosés,et al.  Sixty Years of Network Reliability , 2018, Mathematics in Computer Science.

[21]  Appajosyula Satyanarayana,et al.  A reliability-improving graph transformation with applications to network reliability , 1992, Networks.

[22]  Wendy J. Myrvold,et al.  Maximizing spanning trees in almost complete graphs , 1997, Networks.

[23]  Ronald J. Gould,et al.  Advances on the Hamiltonian Problem – A Survey , 2003, Graphs Comb..

[24]  Pablo Romero,et al.  Petersen Graph is Uniformly Most-Reliable , 2017, MOD.

[25]  Pablo Romero,et al.  Building uniformly most-reliable networks by iterative augmentation , 2017, 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM).

[26]  G. Chartrand,et al.  Graphs & Digraphs , 1986 .

[27]  D. R. Shier,et al.  Maximizing the number of spanning trees in a graph with n nodes and m edges , 1974 .