Super Root Square Mean Labeling of Some Graphs

R. Gopi


Volume :8 , Issue :2 ,Page :75-81



Abstract :Let G be a graph with p vertices and q edges. Let } q p ,..., 3 , 2 , 1 { ) G ( V : f   be an injective function. For a vertex labe ling f, the induced edge labeling ) uv e ( f *  is defined by         2 ) v ( f ) u ( f ) uv ( f 2 2 * or        2 ) v ( f ) u ( f 2 2 then f is called a super root square mean if } q p ,..., 3 , 2 , 1 { )} G ( E e / ) e ( f { ) G ( V ( f     . A graph which admits super root square mean labeling is called super root square mean graph. In this paper, we investigat e super root square mean labeling of some graphs.



  • Download PDF