Edge-antimagic labelings of forests

Title: Edge-antimagic labelings of forests
Creator: Bača, Martin; Lin, Yuqing; Muntaner-Batle, Francesc A.
Relation: Utilitas Mathematica Vol. 81, p. 31-40
Relation: http://utilitasmathematica.org/
Publisher: Utilitas Mathematica Publishing
Resource Type: journal article
Date: 2010
Description: An (a,d)-edge-antimagic total labeling of a graph G(V, E) is a one-to-one map ƒ from V(G) ∪ E(G) onto the integers {1,2,. . . ,|V(G)|+|E(G)|} such that the edge-weights w(uv) = ƒ (u)+ ƒ (uv) + ƒ (v), uv ∈ E(G), form an arithmetic progression with initial term a and common difference d. Such a labeling is called super if it has the property that the vertex labels are the smallest possible. In this paper we examine the existence of super (a, d)-edge-antimagic total labelings of forests, in which every component is a pathlike tree. Indeed, we prove that such a labeling exists when the forest has an odd number of components.
Subject: graph theory; graph labelings; edge-antimagic; path-like trees
Identifier: http://hdl.handle.net/1959.13/931896
Identifier: uon:11199
Identifier: ISSN:0315-3681
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format