On antimagic labelings of disjoint union of complete s-partite graphs

Title: On antimagic labelings of disjoint union of complete s-partite graphs
Creator: Dafik; Miller, Mirka; Ryan, Joe; Baca, Martin
Date: 2008
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/64588
Identifier: vital:5241
Identifier: ISSN:0835-3026
Abstract: By an (a, d)-edge-antimagic total labeling of a graph G(V, E) we mean a bijective function f from V(G) u E(G) onto the set. { 1, 2, ... ,ǀV(C)ǀ+IE(G)I} such that the set of all the edge-weights, w(uv) ,.... f(u) + f(uv) + f(v), uv C E (G), is {a, a+ d, a+ 2d, . . . , a + (lE(G)I-1)d}, for two integers a > 0 and d
Relation: Journal of combinatorial mathematics and combinatorial computing Vol. 65, no. (May 2008 2008), p. 41-49
Rights: Unknown copyright
Rights: This metadata is freely available under a CCO license
Subject: 0101 Pure Mathematics; 0802 Computation Theory and Mathematics
Full Text
Reviewed

		Thumbnail	File	Description	Size	Format