On the Independent Domination Number of the Generalized Petersen Graphs

Abstract

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 [1], we determine an upper bound and a lower bound for the independent domination numbers of these graphs.