Some Results on Local Distance Antimagic Chromatic Number of Graphs

Maurice Genevieva Almeida, Tarkeshwar Singh

Let G=(V,E) be a graph of order n without isolated vertices. A bijection f:V -- {1,2,...n} is called a local distance antimagic labeling if the weights of any two adjacent vertices…