On unreliability polynomials and graph connectivity in reliable network synthesis
Frank T. Boesch · Journal of Graph Theory · 1986
Abstract The analysis and synthesis of reliable large‐scale networks typically involve a graph theoretic model. We give a survey of the graph theoretic notions which are relevant to the synthesis problem. It is shown how a number of unsolved graph extremal problems relate to the synthesis question.