Premium
Vulnerability of communication networks
Author(s) -
Caccetta Louis
Publication year - 1984
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230140111
Subject(s) - persistence (discontinuity) , combinatorics , enhanced data rates for gsm evolution , mathematics , vulnerability (computing) , graph , computer science , discrete mathematics , artificial intelligence , engineering , computer security , geotechnical engineering
Boesch, Harary, and Kabell recently introduced two measures of network vulnerability. They defined the persistence (edge persistence) of a graph as the minimum number of vertices (edges) whose deletion increases the diameter. In their paper they posed questions relating the existence of graphs with a prescribed number of edges, number of vertices, diameter, and persistence (edge persistence). In this paper we consider this extremal problem.