• (k,1)-CONTRA HARMONIC MEAN LABELING OF GRAPHS

Abstract

Let G =(V,E) be a graph with p vertices and q edges. Let f : V(G)  ®{0,1,2,…, k+(q-1)} be an injective function such that the induced edge labeling f(e = uv) is defined by f(e) =  or is a bijection from E to {k, k+1, k+2,…,k+(q-1)}.Then f has a (k,1)- contra harmonic mean labeling. Any graph which admits a (k,1)- contra harmonic mean labeling is called a (k,1)-contra harmonic mean graph. In this paper we investigate the (k,1)- Contra Harmonic mean labeling for some path related graphs.