Distance antimagic labeling of join and corona of two graphs

Abstract

Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices . If the graph admits such a labeling, then is said to be a distance antimagic graph. In this paper we investigate the existence of distance antimagic labelings of and .

Keywords

• distance antimagic labeling
• arbitrarily distance antimagic labeling
• distance magic labeling