Distance antimagic labeling of circulant graphs

A distance antimagic labeling of graph G = ( V , E ) of order n is a bijection f : V ( G ) -> { 1 , 2 , ... , n } with the property that any two distinct vertices x and y satisfy omega ( x ) # omega ( y ), where omega ( x ) denotes the open neighborhood sum Z a is an element of N ( x ) f ( a ) of a vertex x . In 2013, Kamatchi and Arumugam conjectured that a graph admits a distance antimagic labeling if and only if it contains no two vertices with the same open neighborhood. A circulant graph C ( n ; S ) is a Cayley graph with order n and generating set S , whose adjacency matrix is circulant. This paper provides partial evidence for the conjecture above by presenting distance antimagic labeling for some circulant graphs. In particular, we completely characterized distance antimagic circulant graphs with one generator and distance antimagic circulant graphs C ( n ; { 1 , k } ) with odd n .