On (a, d)-distance antimagic graphs

Title: On (a, d)-distance antimagic graphs
Creator: Arumugam, S.; Kamatchi, N.
Relation: Australasian Journal of Combinatorics Vol. 54, Issue 2, p. 279-287
Relation: https://ajc.maths.uq.edu.au/?page=get_volumes&volume=54
Publisher: Combinatorial Mathematics Society of Australasia
Resource Type: journal article
Date: 2012
Description: Let G = (V, E) be a graph of order n. Let f : V → {1, 2,...,n} be a bijection. For any vertex v ∈ V , the neighbor sum u∈N(v) f(u) is called the weight of the vertex v and is denoted by w(v). If w(v) = k, (a constant) for all v ∈ V , then f is called a distance magic labeling with magic constant k. If the set of vertex weights forms an arithmetic progression {a, a + d, a + 2d, . . . , a + (n − 1)d}, then f is called an (a, d)-distance antimagic labeling and a graph which admits such a labeling is called an (a, d)-distance antimagic graph. In this paper we present several results on (a, d)-distance antimagic graphs.
Subject: distance magic labeling; magic squares; antimagic labeling; mathematics
Identifier: http://hdl.handle.net/1959.13/1336638
Identifier: uon:27668
Identifier: ISSN:1034-4942
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format