On Radio D-Distance in Harmonic Mean Labeling of Some Cycle Related Graphs

Abstract

A radio  D-distance in harmonic mean labelling of a connect graph  is an injective map  from the vertex set  to   such that for two distinct vertices  and  of , . The radio D-distance harmonic mean number of  is the maximum number assigned to any vertex of .We discuss about in this paper the radio D-distance in harmonic mean number of acycle related graphs.