IJPAM: Volume 95, No. 3 (2014)





Lahore, PAKISTAN
Abstract. For a connected graph , let
denotes the distance between two distinct vertices
,
in
and diam
be the diameter of
. A radio labeling (or multi-level distance labeling) of a graph
is a function
that assigns positive integers to the vertices of
satisfying
. The largest integer in the range of the labeling is its span. The radio number is the minimum possible span taken over all radio labelings of
, denoted by rn
.
In this paper we show that
,
.
Received: January 1, 2014
AMS Subject Classification: 05C12, 05C15, 05C78
Key Words and Phrases: graph labeling, radio number, corona product of graphs
Download paper from here.
DOI: 10.12732/ijpam.v95i3.2 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2014
Volume: 95
Issue: 3
Pages: 339 -
,
%22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar;
zbMATH;
DOI (International DOI Foundation);
WorldCAT.
This work is licensed under the Creative Commons Attribution International License (CC BY).