Sparse graphs with vertex antimagic edge labelings

Title: Sparse graphs with vertex antimagic edge labelings
Creator: Miller, Mirka; Phanalasy, Oudone; Ryan, Joe; Rylands, Leanne
Relation: AKCE International Journal of Graphs and Combinatorics Vol. 10, Issue 2, p. 193-198
Relation: http://www.akcejournal.org/contents/vol10no2/index.htm
Publisher: Kalasalingam University
Resource Type: journal article
Date: 2013
Description: Hartsfeld and Ringel in 1990 introduced the concept of an antimagic labeling of a graph, that is, a vertex antimagic edge labeling and they also conjectured that every connected graph, except K₂, is antimagic. As a means of providing an incremental advance towards proving the conjecture of Hartsfield and Ringel, in this paper we provide constructions whereby, given any degree sequence pertaining to a tree, we can construct two different vertex antimagic edge trees with the given degree sequence. Moreover, we modify a construction presented for trees to obtain an antimagic unicyclic graph with a given degree sequence pertaining to a unicyclic graph.
Subject: antimagic labeling; antimagic tree; antimagic unicyclic graph
Identifier: http://hdl.handle.net/1959.13/1311885
Identifier: uon:22311
Identifier: ISSN:0972-8600
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format