Super (a, d)-edge antimagic total labelings of friendship graphs

Title: Super (a, d)-edge antimagic total labelings of friendship graphs
Creator: Arumugam, S.; Nalliah, M.
Relation: Australasian Journal of Combinatorics Vol. 53, p. 237-243
Relation: http://ajc.maths.uq.edu.au/?page=get_volumes&volume=53
Publisher: Centre for Discrete Mathematics & Computing
Resource Type: journal article
Date: 2012
Description: An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers {1, 2, 3, . . . , p + q} such that all the edge-weights w(uv) = f(u) + f(v) + f(uv); uv ∈ E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edge-antimagic total labeling is called a super (a, d)-edge-antimagic total labeling ((a, d)-SEAMT labeling) if f(V (G)) = {1, 2, 3, . . . , p}. In this paper we investigate the existence of super (a, d)-edge antimagic total labeling for friendship graphs and generalized friendship graphs.
Subject: antimagic labeling; friendship graphs
Identifier: http://hdl.handle.net/1959.13/1308077
Identifier: uon:21607
Identifier: ISSN:1034-4942
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format