DISTANCE MAGIC GRAPHS - A SURVEY
Abstract: Let G = (V; E) be a
graph of order n. A bijection f : V ! f1; 2; : : : ; ng is called a distance
magic labeling of G if there exists a positive integer k such that P u2N(v) f(u)
= k for all v 2 V; where N(v) is the open neighborhood of v. The constant k is
called the magic constant of the labeling f. Any graph which admits a distance
magic labeling is called a distance magic graph. In this paper we present a
survey of existing results on distance magic graphs along with our recent
results, open problems and conjectures.
Author: S. Arumugam, Dalibor
Froncek and N. Kamatchi
Journal Code: jpmatematikagg110025
