• ON SUPER EDGE BIMAGIC TOTAL LABELING OF Pm X Cn AND ITS RELATED GRAPHS

K. Manimekalai*, K. Thirusangu

Abstract


A Graph G(p, q) is said to have edge bimagic total labeling if there exists a bijection f: V(G)È E(G) ® {1 , 2 , … ,  p+q} such that for each edge  e = (u,v) Î E(G), f(u) + f(v) + f(e) = k1 or k2 ,  where k1 and k2 are two constants. Moreover, G is said to have super edge bimagic total labeling if f(V(G)) = {1 , 2 , … ,  p}. In this paper we prove that the super edge bimagic total labeling for generalized prism Pmx Cn , the Mongolian Ger M(n,m), the generalized web W(m,n), the generalized web without centre  W0(m,n) and  its related graph.


Keywords


edge bimagic total labeling, generalized prism, generalized web, super edge bimagic labeling and total labeling.

Full Text:

PDF


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