IJPAM: Volume 71, No. 2 (2011)
Department of Computer Science and Engineering
National Institute of Technology
Tiruchirapalli, 620015, Tamil Nadu, INDIA
Abstract. Let be a simple,connected and undirected graph with diameter . For a positive integer , a radio -labeling of is an assignment of non-negative integers, called labels to the vertices of such that if are distinct then where is the distance between and . The maximum label (positive integer) assigned by to some vertex of is called the span of . The radio number of denoted by is the minimum span over all radio -labelings of . In this paper, we prove an upper bound for the radio number of binomial tree, Fibonacci trees and uniform caterpillar.
Received: April 15, 2011
AMS Subject Classification: 05C12, 05C15, 05C78
Key Words and Phrases: radio labeling, radio number, binomial tree, Fibonacci tree and uniform caterpillar
Download paper from here.
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395