On designing a network to defend against
โ
A. S. Finbow; B. L. Hartnell
๐
Article
๐
1989
๐
John Wiley and Sons
๐
English
โ 725 KB
This paper considers the following variation on the construction of a reliable communication network. Whenever a vertex is attacked, all vertices within distance 2 are also destroyed (or fail) indirectly. We are interested in designing a connected graph (undirected, all edges of length one) on p ver