k- Super Lehmer-3 Mean Graphs
S.Somasundaram1,S.S.Sandhya2,T.S.Pavithra3
Citation :S.Somasundaram,S.S.Sandhya,T.S.Pavithra, k- Super Lehmer-3 Mean Graphs International Journal of Scientific and Innovative Mathematical Research 2017,5(5) : 1-7
Let f:V(G)?{1,2,3,k+p+q-1} be an injunctive function , For a vertex labeling the induced edge labeling f(e=uv) is defined by f(e)= then f is called k-super Lehmer-3 mean labeling if (f(V(G)Ú {f(e):e ?E(G)}={k,k+1,k+2,k+p+q-1}. A graph which satisfies this labeling condition is called k-super Lehmer-3 mean graph.