On distance magic labeling of graphs

Title: On distance magic labeling of graphs
Creator: Sugeng, K. A.; Fronček, D.; Miller, M.; Ryan, J.; Walker, J.
Relation: Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 71, p. 39-48
Relation: http://www.charlesbabbage.org
Publisher: Charles Babbage Research Centre
Resource Type: journal article
Date: 2009
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.
Subject: magic labeling; vertex; non-regular graphs; distance
Identifier: uon:8133
Identifier: http://hdl.handle.net/1959.13/916856
Identifier: ISSN:0835-3026
Reviewed

		Thumbnail	File	Description	Size	Format