부산대학교 도서관

Let f: V (G) → {1, 2, . . ., n} be a bijection for a graph G of order n. The weight of a vertex v of G denoted by w(v) is defined as sum of labels of all vertices adjacent to vertex v in G. If w(u) ̸= w(v) for every pair of distinct vertices u, v ∈ V (G) then labeling f is called distance antimagic. Any graph G which admits such a labeling is called a distance antimagic graph. In this paper, we determine the distance antimagic labeling of Kneser graph K(2n, n), bipartite Kneser graph H(2n+1, n) using computer-aided algorithm. We investigate the existence of distance antimagic labeling for cycle related graphs having application in surveillance systems of civil engineering and urban planning and verify that vertex weights are distinct using computer algorithm. Also, we present some families of disconnected graphs that admit distance antimagic labeling and later show that Kneser graph K(n, 2) does not admit (a, d)-distance antimagic labeling. [ABSTRACT FROM AUTHOR]