AbstractBoesch, 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.