%0 Journal Article
%T On Complementary Edge Magic Labeling ofCertain Graphs
%J American Journal of Mathematics and Statistics
%@ 2162-8475
%D 2012
%I 
%R 10.5923/j.ajms.20120203.02
%X By G(p, q) we denote a graph having p vertices and q edges, by V(G) and E(G) the vertex set and the edge ¨C set of G respectively. But the vertices and edges are called the elements of the graph. A (p, q) ¨C graph G is called the edge ¨C magic if there exists a bijective function f: V(G) U E(G)¡ú{1,2, ,p+q} such that f(u)+f(v)+f(uv)=k is a constant called the valence of f for any edge uv of G. Given an edge magic f of a graph G(p, q) the function such that =p+q+1-f(x) for all elements of G is said to be complementary to f(x) or complementary edge magic labeling . The purpose of this article is to search for certain graphs Km, n (m, n ¡Ý 1), Cn (n ¡Ý 3), np2, f n (fan) Bn (bwk) and nG (n ¡Ý 2) where G is bipartite or tripartite which have complementary edge magic strength.
%K Edge-Magic Labeling
%K Complementary Edge Magic Labeling
%K 1991 Mathematics Subject Classification. O5C78
%U http://article.sapub.org/10.5923.j.ajms.20120203.02.html