Super Mean Labeling and Square Difference Labeling of Some Graphs

In this paper a study on super mean labeling and square difference labeling of some graphs. 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. The prove that s(pn,k1),s(p2*p4),s(Bn,n),,Cn.k2,n≥3.Generalizd ant prism {An} and the double triangular snake D(Tn) are super mean graph. We proved that some new graphs admit square difference labeling. A function f is called a square difference labeling if there exists a bijection f: V(G)→{0,1,2,….p-1} such that the induced Function f*:E(G) → N given by f*(u v) = |[f(u)]2 - [f(v)]2| for every uv∈E(G) are all distinct. any graph which satisfies the square difference labeling is called a square difference graph .it is investigated that the central graphs of path, square graphs of path some path related graphs fan and gear graphs are all square difference graph.