ISSN 2234-8417 (Online) ISSN 1598-5857 (Print)

 
 
 
   
 
Table of Contents
   
 
2017's   35, 1-2(Jan)
   
 
  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 - 64
Visited Counts - 266
 
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
 
 
   
 
   

The Korean Society for Computational and Applied Mathematics
Copyright ⓒ 2017 JAMI. All rights reserved.  E-mail : chp@sunmoon.ac.kr
Main Office Address: DongNam-Ku, BongMyung 1-kil 47, Ra-104, CheonAn, ChungNam 330-900, KOREA.