Radio Mean Labeling of Digraphs

Abstract

Let\ D be a strong digraph and let \vec{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 \vec{d}(u,\ v) +\left\lceil\frac{f\left(u\right)+f(v)}{2}\right\rceil\geq1+\ diam(D) for every u,v\in V(D). The span of a 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.