Communication Networks with Specified Survivability

摘要

The paper considers the problem of the survivability of communication networks from the point of view of graph theory. Stations are represented by nodes of a graph and communication links between stations are represented by edges of a graph. The strength of a graph is defined with respect to nodes only, edges only, and both nodes and edges. Two methods of constructing graphs with specified strength are derived. Planar graphs are studied and a bound on their strength is found. Methods of finding the strength of an arbitrary graph are given. (Author)