Antimagic valuations of generalized Petersen graphs

Abstract:

A connected graph G is said to be (a, d)-antimagic, for some positive integers a and d, if its edges admit a labeling by the integers 1,2,..., |E(G)| such that the induced vertex labels consist of an arithmetic progression with the first term a and the common difference d. In this paper we prove that the generalized Petersen graph P(n,2) is (3n+6/2, 3)-antimagic for n ≡ 0 (mod 4), n ≥ B.

Año de publicación:

2000

Keywords:

Fuente:

scopus