International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 1 (2012), pp. 47-51 © Research India Publications http://www.ripublication.com Edge-Magic Labeling of some Graphs A. Solairaju 1 and R. Raziya Begam 2 1 Associate Professor of Mathematics, Jamal Mohamed College, Tiruchy-620 020, India E-mail: solairama@yahoo.co.in 2 Assistant Professor of Mathematics, Periyar E.V.R. College, Tiruchy-620 023, Tamilnadu, India. Abstract An edge magic labeling f of a graph with p vertices and q edges is a bijection f: V ∪ E → {1, 2, …, p + q } such that there exists a constant s for any (x, y) in E satisfying f(x) + f(x, v) + f(y)= s. In this paper, the edge-magic labelings of ncm and some other graphs are discussed. Keywords: Edge-magic, Super edge-magic labeling; Merge Graph Introduction In this paper, by a graph we mean only finite simple undirected graphs. The standard notations and terminology are as in [2]. Labeled graphs form useful mathematical models for a wide range of applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, remote control, communication networks and database management [1]. They also have theoretical application in various areas of mathematics such as linear algebra, group theory and combinatorial number theory. Some definitions used in this paper are given below. Definition 1.1: A graph with p vertices and edges is called total edge-magic if there is a bijection f: V∪E → {1, 2, …….., p+q} such that there exists a constant ‘s’ for any (u, v) in E satisfying f(u) + f(u.v) + f(v)= s. The original concept of total edge-magic graph is due to Kotzig and Rosa.[3]. Definition 1.2: A total edge magic graph is called a super edge magic graph if f : (V(G)) → { 1, 2, …… p}. The concept was introduced by Hikoe Enomoto et al., in 1998 [3].Definition 1.3: A merge graph G 1 *G 2 can be formed from two graphs G 1 and G 2 by merging a node of G 1 with a node of G 2 . As an example let us consider T 3, a