Super root square mean labeling of graphs

Let G be a graph with p vertices and q edges. Let be an injective function. For a vertex labeling f, the induced edge labeling is defined by = . f is called a super root square mean if . A graph which admits super root square mean labeling is called super root square mean graph. In this paper, we investigate super root square mean labeling of some graphs.