The graphs considered in this paper are finite and undirected. The symbols V(G) and E(G) denote the vertex set
and edge set of a graph G. The cardinality of the vertex set is called the order of G denoted by P. The cardinality
of the edge set is called the size of G denoted by q. Hence (p,q)is called a graph G.
A graph labeling is an assignment of integers to the vertices or edges. Some basic definitions and notations are
taken from Bondy and Murthy [2],[5]. Different types of graph labelings in directed graphs also been applied in
various fields[6]. A dynamic survey on graph labeling is regularly updated by Gallian [4] and it is published by
Electronic Journal of Combinatory. In this paper, we introduced the new concept Root Mean Square labeling.