Distance Pair Antimagic Labeling on Cycle Related Graphs

Abstract

A distance pair antimagic labeling of a graph  with  vertices is a bijection where  such that the induced weight function  defined by is one-one, where is the open neighborhood of  and the set of all weights  is either of the form or according as  is even or odd. In this paper, we explored the result on distance pair antimagic labeling of cycle related graphs. Also we investigated the closed distance magic labeling of circulant graph and its complement.