Radio mean number of some wheel related graphs

Abstract EN

A Radio Mean labeling of a connected graph G is an injective map f from the vertex set V (G) to the set of natural numbers N such that for each distinct vertices u and v of G, d (u, v) + [f (u) + f (v) / 2] ≥ 1 + diam (G).

The radio mean number of f, rmn (f), is the maximum number assigned to any vertex of G under the labeling f.

The radio mean number of G, rmn (G) is the minimum value of rmn (f) taken over all radio mean labelings f of G.

Here we have found the radio mean number of some graphs derived from wheels.