• Aswathy .H
• Dr.S.S. Sandhya

A graph G = (V,E) with p vertices and q edges is said to be a Root Square Mean graph if it is possible to label the vertices x∈V with distinct labels f (x) from 1,2,……….. q+1 in such a way that when each edge e = uv is labeled with f (e=uv) = ⌈√((〖f(u)〗^2+〖f(v)〗^2)/2)⌉ or ⌊√((〖f(u)〗^2+〖f(v)〗^2)/2)⌋, then the resulting edge labels are distinct. In this case f is called a Root Square Mean labeling of G . In this paper we investigate the K- Root Square Mean labeling of some Graphs

Labeling, Root Square Mean Labeling, Path, Twig , Triangular Ladder.

"On k- Root Square Mean Labeling of Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 9, page no.c419-c424, September-2021, Available :http://www.jetir.org/papers/JETIR2109254.pdf

"On k- Root Square Mean Labeling of Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.8, Issue 9, page no. ppc419-c424, September-2021, Available at : http://www.jetir.org/papers/JETIR2109254.pdf