On Complementary Edge Magic Labeling ofCertain Graphs

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 – set of G respectively. But the vertices and edges are called the elements of the graph. A (p, q) – graph G is called the edge – 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.