Radio Mean Labeling of Digraphs

Radio Mean Labeling of Digraphs

Blog Article

Let D be a strong digraph and let ec{d}(u, v) denote the distance between any two BLUSH TOASTED CINNAMON #1215 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 u,vin 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 Baby Wipes paper, we analyze radio mean labeling for some newly defined digraphs.