Volume :8 , Issue :4 ,Page :248 - 255

Abstract :A graph = ( , ) with vertices and edges is said to be a Root Cube Mean graph if it is possible to label the vertices ? with distinct elements ( ) from 1,2,..., +1 in such a way that when each edge = is labeled with f(e=uv) = or , then the resulting edge labels are distinct. Here is called a Root Cube Mean labeling of . In this paper we prove that Path Cycle , Comb, Ladder, and Triangular Snake are Root Cube Mean graphs. ,