Consecutive-magic labeling of generalized Petersen graphs

Abstract:

The generalized Petersen graph P(n, k) has vertex set V = { u1 , u2 , . . . , un , v1 , v2 , . . . , vn } and edge set E = { ui ui + 1 , ui vi , vi vi + k \ for 1 ≤ i ≤ n and 1 ≤ k ≤ [n-1/2], with indices taken modulo n}. We deal with the problem of labeling edges of the generalized Petersen graph P(n, k) and we show that P(n, k) is consecutive-magic iff n is even (n ≥ 4) and k ≤ n/2 - 1.

Año de publicación:

2000

Keywords:

Fuente:

scopus