Deborah Ajayi, Tayo Adefokun


Given a graph $G$, whose vertex set is $V(G)$, the radio labelling of $G$ is a variation of vertex labelling of $G$ which satisfy the condition that given any $v_1,v_2 \in V(G)$, and some positive integer function $f(v)$ on $V(G)$, then $|f(v_1)-f(v_2)| \geq \textmd{diam}(G)+1-d(v_1,v_2)$. Radio labelling guarantees a better reduction in interference in signal-dependent networks since no two vertex have the same label. The radio number $rn(G)$ of $G$ is the smallest possible value of $f(v)$ such that for any other $v_k \in V(G)$, $f(v_k) < f(v_k)$. In this work, we consider a Cartesian product graph obtained from a star and a path and determined upper and lower bounds of the radio number for the family of these graphs.


G. Chartrand, D. Erwin, F Harary and P. Zhang, Radio Labelings of Graphs, Bull. Inst. Combin. Appl. 33 (2001) 77-85.

G. chartrand, D. Erwin and P. Zhang, A Graph Labeling Problem Suggested by FM Channel Restrictions, Bull. Inst. Combin. Appl. 43 (2005) 43-57.

W. K. Hale, Frequency Assignment Theory and Applications, Proc. IEEE, 68 (1980) 1497 - 1514

T-S Jiang, The Radio Number of Grid Graphs, arXiv:1401.658v1. 2014.

D. Liu and X. Zhu, Multilevel Distance Labelings for Paths and Cycles, SIAM J. Discrete Math. 19 (2005) 610-621.

R. Marinescu-Ghemeci, Radio Numberfor some Thorn Graphs, Discussiones Mathematicae Graph Theory 30 (2010) 201-222.

L. Saha and P. Panigrahi, On the Radio Numbers of Toroidal Grid, Aust. Jour. Combin. 55 (2013) 273-288.


  • There are currently no refbacks.

Copyright (c) 2018 Journal of the Nigerian Mathematical Society

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