
ISSN 22348417 (Online)
ISSN 15985857 (Print)










Table of Contents 









RADIO NUMBER OF TRANSFORMATION GRAPHS OF A PATH 


By S. YOGALAKSHMI, B. SOORYANARAY
..........1696 






Generic
Number  1696 
References
 17 
Written
Date 
January 17th, 17 
Modified
Date 
January 18th, 17 
Downloaded
Counts  72 
Visited
Counts  278 

Original
File 


Summary 
A radio labeling of a graph $G$ is a function $f:V(G)\rightarrow \{1,2,\ldots, k\}$ with the property that $\mid f(u)  f(v)\mid \geq 1 + diam(G)  d(u, v)$ for every pair of vertices $u,v\in V(G)$, where $diam(G)$ and $d(u, v)$ are diameter and distance between $u$ and $v$ in the graph $G$ respectively. The radio number of a graph $G$, denoted by $rn(G)$, is the smallest integer $k$ such that $G$ admits a radio labeling.
In this paper, we completely determine radio number of all transformation graphs of a path 







