A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Super Mean Labeling of Some Classes of Graphs

2012
*
International J.Math. Combin
*
unpublished

Let G be a (p, q) graph and f : V (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 a super mean labeling if f (V)∪{f * (e) : e ∈ E(G)} = {1, 2, 3,. .. , p+q}. A graph that admits a super mean labeling is called a super mean graph. In this paper we prove that S(Pn⊙K1), S(P2×P4), S(Bn,n), Bn,n : Pm , Cn⊙K2, n ≥ 3, generalized antiprism A m n and the

fatcat:pbazrvble5bltplm6zh5qwux5q