On Radio Heronian D-Distance Mean of Some Standard Graphs

Main Article Content

Dinesh M, K. John Bosco

Abstract

A Radio Heronian Mean D-distance Labeling of a connected graph  is an injective map from the vertex set  to the N such that for two distinct vertices  and of , DD where D denotes the D-distance between  and and D denotes the D-diameter of G. We study on in this paper about some standard graphs.

Article Details

Section
Articles