The bondage number of generalized Petersen graphs \(P(n,2)\) (Q2188017)

Summary: The domination number \(\gamma\left( G\right)\) of a nonempty graph \(G\) is the minimum cardinality among all subsets \(D\subseteq V\left( G\right)\) such that \(N_G\left[ D\right]=V\left( G\right)\). The bondage number \(b\left( G\right)\) of a graph \(G\) is the smallest number of edges whose removal from \(G\) results in a graph with larger domination number. The exact value of \(b\left( P \left( n , 2\right)\right)\) for \(n=0,3,4\pmod{5}\) and the bounds of \(b\left( P \left( n , 2\right)\right)\) for \(n=1,2\pmod{5}\) are determined.