• EDGE TRIMAGIC GRACEFUL LABELING OF SOME GRAPHS

M. REGEES, J. A. JOSE EZHIL

Abstract


A (p, q) graph G is called edge trimagic total if there exists a bijection f: V(G) È E(G) ® {1, 2, 3, …, p+q} such that for each edge xy in E(G) the value of  f(x) + f(xy) + f(y) = K1 or K2 or K3. G is called edge trimagic graceful if there exists a bijection f : V(G) È E(G) ® {1, 2, 3, …, p+q} such that for each edge xy in E(G), | f(x) f(xy) + f(y) | = C1 or C2 or C3, where C1, C2  and C3 are constants. In this paper, we proved that the Umbrella graph Un, m, circular ladder graph CL(n) and the Dumbbell graph Dbn are edge trimagic graceful graphs.


Keywords


Graph, Labeling, Magic, Trimagic, Graceful.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2018 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter