Radio Harmonic Mean Labeling of Bistar Related Graphs

Abstract

A radio harmonic mean labeling of a connected graph G is a one to one map f from the vertex set V(G) to the set of natural numbers N such that for any two distinct vertices u and v of  G satisfies the condition .The radio harmonic mean number of f,  is the maximum number assigned to any vertex of G. The radio harmonic mean number of G,  is the minimum value of  taken over all radio harmonic mean labeling f of G. In this paper we have determined the radio harmonic mean number of special classes of bistar graphs.