• P. PADMA PRIYA
• AROKIA MARY

Let G(V,E) be a graph with the vertex set V and the edge set E respectively. By a graph G=(V,E). We mean a finite undirected with neither loops nor multiple edges. The number of vertices of G is called order of G and it is denoted by p. Let G be a (p,q) graph. A super mean graph on G is an injection f: V {1,2,3,……..p+q} such that, for each edge e=uv in E labeled by f*(e)=[ (f(u)+f(v))|2]. The set f(v) {f ‘(e): e E}forms {1,2,3,……p+q}. A graph which admits super mean labelling is called super mean graph. The splitting graph S’(G) of a graph G is obtained by adding a new vertex V’ corresponding to each vertex V of G such that N(V)=N(V’). We have showed that graphs S’(Pn) and S’(Cn) are super mean. Where Pn is a path on n vertices and Cn is a cycle on n vertices.

Super mean labelling, path graph, cycle graph, splitting graph

"On Super mean Labeling for Splitting graph of path and cycle", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.231-235, April-2019, Available :http://www.jetir.org/papers/JETIR1904L31.pdf

"On Super mean Labeling for Splitting graph of path and cycle", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp231-235, April-2019, Available at : http://www.jetir.org/papers/JETIR1904L31.pdf