Beggas, FairouzFairouzBeggasTurau, VolkerVolkerTurauHaddad, MohammedMohammedHaddadKheddouci, HamamacheHamamacheKheddouci2019-11-142019-11-142019-10-01Discrete Mathematics, Algorithms and Applications 5 (11): 1950058 (2019-10-01)http://hdl.handle.net/11420/3791A vertex subset S of a graph G = (V,E) is a [1, 2]-dominating set if each vertex of V 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.en1793-830920195Generalized Petersen graphvertex domination[ 1, 2 ] -domination[ 1, 2 ] -total dominationJournal Article10.1142/S1793830919500587Other