graceful labelings of the generalized petersen graphs

A graceful labeling of a graph g = (v, e) with m edges is an injection f : v (g) → {0, 1, . . . , m} such that the resulting edge labels obtained by |f(u) − f(v)| on every edge uv are pairwise distinct. for natural numbers n and k, where n > 2k, a generalized petersen graph p(n, k) is the graph whose vertex set is {u1, u2, . . . , un} ∪ {v1, v2, . . . , vn} and its edge set is {uiui+1, uivi, vivi+k : 1 ≤ i ≤ n}, where subscript arithmetic is done modulo n. we propose a backtracking algorithm with a specific static variable ordering and dynamic value ordering to find graceful labelings for generalized petersen graphs. experimental results show that the presented approach strongly outperforms the standard backtracking algorithm. the proposed algorithm is able to find graceful labelings for all generalized petersen graphs p(n, k) with n ≤ 75 within only several seconds.