Edge-antimagicness for a class of disconnected graphs

Title: Edge-antimagicness for a class of disconnected graphs
Creator: Bača, Martin; Brankovic, Ljiljana
Relation: Ars Combinatoria Vol. 97A, p. 145-152
Relation: http://www.combinatorialmath.ca/arscombinatoria/vol97A.html
Publisher: Charles Babbage Research Centre
Resource Type: journal article
Date: 2010
Description: Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total labeling on G is a one-to-one map f from V(G) ⋃ E(G) onto the integers 1, 2, ... , |V(G) |+| E(G)| with the property that the edge-weights w(uv) = f(u) + f(v) + f(uv), uv E E(G), form an arithmetic progression starting from a and having common difference d. Such a labeling is called super if the smallest labels appear on the vertices. In this paper, we investigate the existence of super (a, d)-edge-antimagic total labelings of disjoint union of multiple copies of complete bipartite graph.
Identifier: http://hdl.handle.net/1959.13/928990
Identifier: uon:10506
Identifier: ISSN:0381-7032
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format