Let D be a strong digraph and let ec{d}(u, v) denote the distance between any two vertices in D.A radio mean labeling is a one-to-one mapping f from V(D) to N satisfying the condition ec{d}(u, v) +leftlceil rac{fleft(u
ight)+f(v)}{2}
ight
ceilgeq1+ diam(D) for every sukin body lotion woolworths u,vin V(D).The span of a sara stedy stand aid labeling f is the maximum integer that f maps to a vertex ofD.
The radio mean number of D, rmn (D) is the lowest span taken over all radio mean labelings of the graph D.In this paper, we analyze radio mean labeling for some newly defined digraphs.