On super (a, d)-edge-antimagic total labeling of disconnected graphs | NOVA. The University of Newcastle's Digital Repository

Home

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

Title: On super (a, d)-edge-antimagic total labeling of disconnected graphs
Author/Creator: Dafik; Miller, Mirka; Ryan, Joe; Bača, Martin
Institution: The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
Description: A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f : V(G) U E(G) → {1,2, . . . , p + q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv), uv ϵ E(G), form an arithmetic sequence with the first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a,d)-edge-antimagic total properties of disconnected graphs mCn and mPn.
Relation: Discrete Mathematics Vol. 309, Issue 15, p. 4909-4915
Publisher Link: http://dx.doi.org/10.1016/j.disc.2008.04.031
Date: 2009
Publisher: Elsevier
Keyword(s): (a,d)-edge-antimagic total labeling; super (a,d)-edge-antimagic total labeling; mCn; mPn
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/806907
Identifier: ISSN:0012-365X

26 Visitors

29 Hits

NOVA. The University of Newcastle's Digital Repository