Radio Labeling For Some Cycle Related Graphs

S K Vaidya, P L Vihol


Let $G=(V(G),E(G))$ be a connected graph and let $d(u,v)$ denote the distance between any two vertices in $G$. The maximum distance between any pair of vertices is called the diameter of $G$ denoted by $diam(G)$. A radio labeling( or multilevel distance labeling) for $G$ is an injective function $f:V(G) \longrightarrow N\cup\{0\}$ such that for any vertices $u$ and $v$, $|f(u)-f(v)| \geq diam(G)-d(u,v)+1$. The span of $f$ is the largest number in $f(V)$. The radio number of $G$, denoted by $r_n(G)$ is the minimum span of a radio labeling of $G$. In this paper we determine upper bounds of radio numbers for cycle with chords and $n/2$-petal graph. Further the radio number is completely determined for the split graph and middle graph of cycle $C_{n}$.

Full Text:



  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.