Optimally reliable networks |
| |
Authors: | D H Smith |
| |
Institution: | (1) Department of Mathematics and Computing, The Polytechnic of Wales, CF37 1DL Pontypridd, Mid-Glamorgan, Wales, UK |
| |
Abstract: | In this paper, we consider the probability of disconnection of a graph as a measure of network reliability. We compare the vertex and edge failure cases, and then concentrate on the vertex failure case. Optimal graphs are graphs which minimise the probability of disconnection for a given number of vertices and edges when the probability of vertex failure is small. We describe the known results on the construction of optimal regular graphs and present some new results on the construction of optimal nonregular graphs. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|