Downloads: 115 | Views: 236

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

Rate This Article!      

k-Super Mean Labeling of Some Graphs

Dr. M. Tamilselvi, K. Akilandeswari, V. Suguna

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)) /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 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 of, S (B_ (n, n)), and T_nK_1.

Keywords: Super mean labeling, Super mean graph, kSuper mean labeling, kSuper mean graph, Bistar graphs, T_nK_1

Edition: Volume 5 Issue 6, June 2016

Pages: 2310 - 2312

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

Click to Cite this Article