Downloads: 108 | Views: 244

Research Paper | Mathematics | India | Volume 5 Issue 6, June 2016 | Popularity: 6.1 / 10

Rate This Article!      

Some More Results on k ? Super Mean Graphs

Dr. M. Tamilselvi, K. Akilandeswari, N. Revathi

Abstract: Let G be a (p, q) graph and fV (G) {1, 2, 3, , p+q} be an injection. For each edge e = uv, let f^* (e) = (f (u) +f (v)) /2if f (u) +f (v) is even and f^* (e) = (f (u) +f (v) +1) /2 if f (u) +f (v) is odd, then f is called super mean labeling if f (V) {f^* (e) eE (G) }={1, 2, 3, , p+q}. A graph that admits a super mean labeling is called Super mean graph. Let G be a (p, q) graph and fV (G) {k, k+1, k+2, , p+q+k-1} be an injection. For each edge e = uv, let f^* (e) = (f (u) +f (v)) /2 if f (u) +f (v) is even and f^* (e) = (f (u) +f (v) +1) /2 if f (u) +f (v) is odd, then f is called k-super mean labeling if f (V) {f^* (e) eE (G) }={k, k+1,. . , p+q+k-1}. A graph that admits a k-super mean labeling is called k-Super mean graph. In this paper we investigate k super mean labeling ofH_n, H_nmK_1, A (DTn), n (P_1 (K_2)) and KP (r, s, l).

Keywords: k-Super mean labeling, k-Super mean graph, H_n, H_nmK_1, A DTn, n P_1 K_2 and KP r, s, l

Edition: Volume 5 Issue 6, June 2016

Pages: 2149 - 2153

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article