SOME RESULTS ON SUPER MEAN GRAPHS

Let G(V, E) be a graph with p vertices and q edges and f: V(G) -> {l, 2, 3,..., p + q} be an injection. For each edge e = uv, let f*(e) = [f(u) + f(v)/2]. Then f 2 is called a super mean labeling of G if f (V(G))boolean OR{f*(e): e epsilon E (G)} = {1, 2, p + q}. A graph that admits a super mean labeling is called a super mean graph. In this paper we prove that < S-m,S-n: Pm+1>, <P-2m o K-1,K- n> and caterpillar are super mean graphs. We further establish that if T is a Tp-tree then T circle dot (K-n) over bar is also a super mean graph.