Super edge-antimagic labelings of the generalized Petersen graph P(n, (n-1)/2))

Title: Super edge-antimagic labelings of the generalized Petersen graph P(n, (n-1)/2))
Creator: Baca, Martin; Baskoro, Edy; Simanjuntak, Rinovia; Sugeng, Kiki Ariyanti
Date: 2006
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/43805
Identifier: vital:61
Identifier: ISSN:0315-3681
Abstract: An (a,d)-edge-antimagic total labeling of G is a one-to-one mapping f taking the vertices and edges onto 1, 2,..., vertical bar V (G)vertical bar + vertical bar E(G)vertical bar so that the edge-weights w(xy) = f(x) + f(y) + f(xy), xy is an element of E(G), form an arithmetic progression with initial term a and common difference d. An (a, d)-edge-antimagic total labeling is called super (a,d)-edge-antimagic total if f(V(G)) = {1, 2,..., vertical bar V(G)vertical bar}. This paper considers such labelings applied to cycles and generalized Petersen graphs.; C1
Publisher: Utilitas Mathematica Publishing Incorporated
Relation: Utilitas Mathematica Vol. 70, no. (Jul 2006), p. 119-127
Rights: Copyright Utilitas Mathematica Publishing Incorporated
Rights: This metadata is freely available under a CCO license
Subject: 0104 Statistics; Magic labeling
Reviewed