Here we consider an infinite sub-family of the generalized Petersen graphs $P(n,k)$ for $n=2k+1\geq 3,$ and using the two algorithms that A. Behzad et al presented in , we determine an upper bound and a lower bound for the independent domination numbers of these graphs.
"On the Independent Domination Number of the Generalized Petersen Graphs." Afr. Diaspora J. Math. (N.S.) 10 (1) 18 - 22, 2010.