Note on super antimagicness of disconnected graphs

Title: Note on super antimagicness of disconnected graphs
Creator: Bača, Martin; Lin, Yuqing; Semaničová-Feňovčíková, Andrea
Relation: AKCE International Journal of Graphs and Combinatorics Vol. 6, Issue 1, p. 47-55
Relation: http://www.akcejournal.org/contents/vol6no1/vol6_no1_6.htm
Publisher: Kalasalingham University
Resource Type: journal article
Date: 2009
Description: A labeling of a graph is a mapping that carries some sets of graph elements into numbers (usually the positive integers). An (a, d)-edge-antimagic total labeling of a graph G(V, E) with p vertices and q edges is a one-to-one mapping f from V(G) ⋃ E(G) onto the set {1,2,...,|V(G)|}, such that the set of all the edge-weights, wf(uv) = f(u) + f(uv) + f(v), uv ∊ E(G), forms an arithmetic sequence starting from a and having a common difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In this paper we mainly study the super (a,d)-edge-antimagic total labelings of disconnected graphs.
Subject: edge-antimagic total labeling; super edge-antimagic total labeling
Identifier: uon:8001
Identifier: http://hdl.handle.net/1959.13/916455
Identifier: ISSN:0972-8600
Reviewed

		Thumbnail	File	Description	Size	Format