Abstract
The super–connectivity of a graph G is the minimum number of vertices whose removal disconnects the graph without isolating a vertex. In this paper, we prove that the super–connectivity of double generalized Petersen graph DP(n, k) is equal to four when n ≥ 4, k ≥ 1 and n ≠ 2k.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science