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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
