Edge magic labeling of graphs

Abstract

Yegnanarayanan[4] proved some results by introducing (1,1) Edge magic labeling and raised the following two conjectures and an open problem. 1. The disjoint union of 2t copies of P₂, t ≥ 1, has a (1,1) edge magic labeling. 2. The generalised n-crown C_n ⊙ K_{1, n} is (1,1) edge magic. 3. Determine the values of m and n such that mPn is (1,1) edge magic. In this paper we prove the two conjectures and partially settele the open problem raised by him.