K-SUPER CONTRA HARMONIC MEAN LABELING OF GRAPHS

Abstract

In Let f :V(G){k,k 1,k  2,...,k  p  q 1}be an injective function. Then the induced edge labeling
( ) * uv e f  defined by 






  







  

3
( ) ( ) ( ) ( )
3
( ) ( ) ( ) ( )
( ) * f u f u f v f v
or
f u f u f v f v
f e
, then f is called k-Super
heronian Mean labeling, if { f (V(G))}{ f (e) / eE(G)} {k,k 1,k  2,...,k  p  q 1}.
A graph which admits k-super heronian mean labeling is called a k-super heronian mean graph. In this
paper we introduce and study k-super heronian mean labeling graph. Here k denoted as any positive
integer greater than or equal to 1.