The Bondage Number of Generalized Petersen Graphs

Algorithm 1

The construction for graph G(n − 5) from graph G(n).

	Input: the graph with , , .
	Output: the graph .
	Step 1. Delete the subset of vertices , along with their 18 incident edges. Denote the resulting graph by .
	Step 2. Define the graph to have vertex set and edge set . Return .