Abstract: A radio labeling
of a connected graph G is an
assignment of distinct positive integers to the vertices of G, with labeled such that
for every two
distinct vertices u, v of G, where diamGis the diameter of G. The radio
number of a radio labeling of G
is the maximum label assignment to a vertex of G.
The radio number of G
is over all radio labelings f
of G. Further we call a graph G
radio graceful if
In
this paper, we determine the radio number of the graph for all or 2 or 4 (mod 6). In addition, we
show that is radio graceful if and only if
Keywords and phrases: radio labeling, radio number, radio graceful graphs.
