Perfectly antimagic total graphs

Abstract

An one-one correspondence function λ from V(G) ∪ E(G) to the set {1, 2, …, |V(G) | + |E(G) |} is a total labeling of a finite undirected graph G without loops and multiple edges, where |V(G) |and |E(G) | are the cardinality of vertex and edge set of G respectively. A perfectly antimagic total labeling is a totally antimagic total labeling whose vertex and edge-weights that are also pairwise distint. Perfectly antimagic total (PAT) graph is a graph having such labeling. The topic of discovering perfectly antimagic total labeling of some families of graphs is discussed in this paper. We also came up with certain conclusions about dual of a perfectly antimagic total graphs. Finally, we provided that the necessary and sufficient condition for a dual of a regular and irregular PAT graph to be a PAT graph.