Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/916856

OpenURL Link
Title
On distance magic labeling of graphs
Author/Creator
Sugeng, K. A.;  Fronček, D.;  Miller, M.;  Ryan, J.;  Walker, J.
Institution
The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
Description
Distance magic labeling of a graph of order n is a bijection f : V → {1, 2, ... , n} with the property that there is a positive integer constant k such that for any vertex x, ΣyϵN(x)f(y) = k, where N(x) is the set of vertices adjacent to x. In this paper, we prove new results about the distance magicness of graphs that have minimum degree one or two. Moreover, we construct distance magic labeling for an infinite family of non-regular graphs.
Relation
Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 71, p. 39-48
Relation
http://www.charlesbabbage.org
Date
2009
Publisher
Charles Babbage Research Centre
Keyword(s)
magic labeling;  vertex;  non-regular graphs;  distance
Resource Type
journal article
Identifier
http://hdl.handle.net/1959.13/916856
Identifier
ISSN:0835-3026
Reviewed
Reviewed
48 Visitors 58 Hits 0 Downloads
Save/E-mail Citation
Citation Format
E-mail Address
Subject
"Journal of Combinatorial Mathematics and Combinatorial Computing"
 
OR