Radio mean D-distance number of cycle-related graphs

Abstract

A Radio Mean D-distance labeling of a connected graph G is an injective map f from the vertex set V(G) to the such that for two distinct vertices u and v of G, dD(u, v) + ≥ 1 + diamD(G), where dD(u, v) denotes the D-distance between u and v and diamD(G) denotes the D-diameter of G. The radio mean D-distance number of f, rmn D(f) is the maximum label assigned to any vertex of G. The radio mean D-distance number of G, rmn D(G) is the minimum value of rmn D(f) taken over all radio mean D-distance labeling f of G. In this paper we find the radio mean D-distance number of cycle-related graphs.