Skip to content Skip to navigation

On the Independent Domination Number of the Generalized Petersen Graphs

Volume 10, Number 1 (2010), 18 - 22

On the Independent Domination Number of the Generalized Petersen Graphs

Price: $20.00

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.