International Journal of Advance Research, Ideas and Innovations in Technology, 2017
A Radio Mean D-distance labeling of a connected graph G is an injective map f from the vertex set... more A Radio Mean D-distance labeling of a connected graph G is an injective map f from the vertex set V(G) to N such that for two distinct vertices u and v of G, dD(u, v) + ⌈(f(u)+f(v))/2⌉ ≥ 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, rmnD(f) is the maximum label assigned to any vertex of G. The radio mean D-distance number of G, rmnD(G) is the minimum value of rmnD(f) taken over all radio mean D-distance labeling f of G. In this paper we find the radio mean D-distance number of banana tree, thorn star and cone graph.
International Journal of Advance Research, Ideas and Innovations in Technology, 2017
A Radio Mean D-distance labeling of a connected graph G is an injective map f from the vertex set... more A Radio Mean D-distance labeling of a connected graph G is an injective map f from the vertex set V(G) to N such that for two distinct vertices u and v of G, dD(u, v) + ⌈(f(u)+f(v))/2⌉ ≥ 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, rmnD(f) is the maximum label assigned to any vertex of G. The radio mean D-distance number of G, rmnD(G) is the minimum value of rmnD(f) taken over all radio mean D-distance labeling f of G. In this paper we find the radio mean D-distance number of banana tree, thorn star and cone graph.
Uploads
Papers by John Bosco