No Detail Found!

Optimal radio labelings of graphs

Author(s)
Devsi Bantva Lukhdhirji Engineering College, Morvi - 363 642, Gujarat, India
Abstract
Let N be the set of positive integers. A radio labeling of a graph G is a mapping ' : V (G) ! N [ f0g such that the inequality j'(u) '(v)j diam(G) + 1 d(u; v) holds for every pair of distinct vertices u; v of G, where diam(G) and d(u; v) are the diameter of G and distance between u and v in G, respectively. The radio number rn(G) of G is the smallest number k such that G has a radio labeling ' with maxf'(v) : v 2 V (G)g = k. Das et al. [Discrete Math. 340 (2017) 855-861] gave a technique to find a lower bound for the radio number of graphs. In [Algorithms and Discrete Applied Mathematics: CALDAM 2019, Lecture Notes in Computer Science 11394, Springer, Cham, 2019, 161-173], Bantva modified this technique for finding an improved lower bound on the radio number of graphs and gave a necessary and sufficient condition to achieve the improved lower bound. In this paper, one more useful necessary and sufficient condition to achieve the improved lower bound for the radio number of graphs is given. Using this result, the radio number of the Cartesian product of the path and wheel graphs is determined.
Publication Details
Page(s) 91-98
Published Journal: Discrete Mathematics Letters, Volume: 10, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
Cartesian product of graphs, wheel graph, radio labeling, radio number
0

Citations

0

Downloads

38

Views