ABSTRACT
A radio labeling f of G is an assignment of positive integers to the vertices of G satisfying, │f (u) – f (v)│≥ diam(G) + 1 – d (u ,v) u, v ∈ V (G) where d (u ,v) is the distance between any two vertices in the graph. The radio number denoted by rn (G) is the minimum span of a radio labeling for G. In this paper, an alternate proof for radio number of cycles and exact radio number for their total graphs has been discussed.
Support the magazine and subscribe to the content
This is premium stuff. Subscribe to read the entire article.
Login if you have purchased
