… paper we give a vertex-magic total labeling for the generalized Petersen graphs Pšn, mŽ for
all n ! … THEOREM AA generalized Petersen graph Pšn, mŽ is ša, 1Ž-antimagic if and only if …

… The concept of an (a,d )-antimagic labelings was introduced by … that the generalized Petersen
graph P(n,2) is ( (3n+6)/2,3) - … t and n (n 3 ), the disjoint union of t copies of the generalized …

… and wheels are totally antimagic total. The edgedistance-balanced property of … generalized
Petersen graphs was given in [3, 4]. Also, antimagic labelings of some cycle related graphs, …

… such a labeling is said to be an arbitrarily distance antimagic graph. In this … antimagic
labelings for \(rP_n\), generalised Petersen graph \(P(n,k), \ n \ge 5\), Harary graph \(H_{4,n}\) for \(n\…

… y∈N(x) f(xy). By an (a, d)-vertex-antimagic edge (VAE) labeling of a graph G we mean a
one-to-one … in G is {a, a + d,...,a + (p − 1)d}, where a > 0 and d ≥ 0 are two fixed integers. The (a, …

… labelings and show how to construct such labelings for some families of … generalised
Petersen graphs. We also show that some families of graphs do not admit super (a,d)-VAT labelings…

… We will call such a labeling a totally antimagic total labeling (TAT labeling) and a graph that
admits such a labeling a totally antimagic total graph (TAT graph). If, moreover, the vertices …

… In this section, we shall use the edge-antimagic labelings of paths Pn and the partitions of …
d-antimagic labeling for several families of plane graphs. The friendship graph Fn is a set of n …

… antimagic total labeling in which the edge labels are 1, 2,...,q and vertex labels are q + 1, q +
2,...,q + p. … of e-super (a, d)-edge antimagic total labeling for total graphs of paths, copies of …