DISTANCE MAGIC GRAPHS - A SURVEY
By S. Arumugam, D. Froncek, N. Kamatchi. 2012
97 citations recorded by the source corpus.
Let G = (V;E) be a graph of order n. A bijection f : V r {1, 2,...,n} is called a distance magic labeling of G if there exists a positive integer k such that S f(u) = k for all v e 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. DOI : http://dx.doi.org/10.22342/jims.0.0.15.11-26
Subfields: Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/40cc86c60c773a6d88f976c8c552db6fb245888d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
Citations in the corpus
- A Dynamic Survey of Graph Labeling (2009, background): “A survey of results on distance magic (sigma, 1-vertex) labelings through 2009 is given in [138].”
- Handicap distance antimagic graphs and incomplete tournaments (2013, background): “A survey of results on distance magic graphs can be found in [1].”