[1,2]-Domination in generalized Petersen graphs.

A vertex subset S of a graph G = (V , E) is a [ 1 , 2 ] -dominating set if each vertex of V ∖ S is adjacent to either one or two vertices in S. The minimum cardinality of a [ 1 , 2 ] -dominating set of G , denoted by γ [ 1 , 2 ] (G) , is called the [ 1 , 2 ] -domination number of G. In this paper, the [ 1 , 2 ] -domination and the [ 1 , 2 ] -total domination numbers of the generalized Petersen graphs P (n , 2) are determined. [ABSTRACT FROM AUTHOR]