Radio number of graphs of diameter three

Abstract

A radio labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G with x∈V(G) labeled c(x), such that

for every two distinct vertices u, v of G, where diam G is the diameter of G. The radio number r _n (c) of a radio labeling c of G is the maximum label assigned to a vertex of G. The radio number r _n (G) of G is min {r _n (c)} over all radio labelings c of G. In this paper radio number of graphs of diameter three are investigated.

Keywords:

• Radio labeling
• radio number