Radio number of the cartesian product of a tree and a complete graph
Congressus Numerantium · 2025
DOI: 10.61091/cn235-05 ↗Kurz gefasst
Fachartikel in der Zeitschrift Congressus Numerantium, 2025. Verfasst von Payal Vasoya.
Abstract (Originalsprache)
A radio labeling of a graph \( G \) is a mapping \( f : V(G) \to \{0, 1, 2, \dots\} \) such that \( |f(u)-f(v)| \geq \text{diam}(G) + 1 - d(u,v) \) for every pair of distinct vertices \( u,v \) of \( G \), where \( \text{diam}(G) \) is the diameter of \( G \) and \( d(u,v) \) is the distance between \( u \) and \( v \) in \( G \). The radio number \( \text{rn}(G) \) of \( G \) is the smallest integer \( k \) such that \( G \) admits a radio labeling \( f \) with \( \max\{f(v) : v \in V(G)\} = k \). In this paper, we give a lower bound for the radio number of the Cartesian product of a tree and a complete graph and give two necessary and sufficient conditions for the sharpness of the lower bound. We also give three sufficient conditions for the sharpness of the lower bound. We determine the radio number of the Cartesian product of a level-wise regular tree and a complete graph which attains the lower bound. The radio number of the Cartesian product of a path and a complete graph derived in [B. M. Kim, W. Hwang, and B. C. Song, Radio number for the product of a path and a complete graph, J. Comb. Optim., 30 (2015), 139--149] can be obtained using our results in a short way.
Zitieren
APA
Vasoya, P. (2025). Radio number of the cartesian product of a tree and a complete graph. Congressus Numerantium. https://doi.org/10.61091/cn235-05
Vancouver
Vasoya P. Radio number of the cartesian product of a tree and a complete graph. Congressus Numerantium. 2025. doi:10.61091/cn235-05
BibTeX
@article{Vasoya2025,
author = {Vasoya, Payal},
title = {Radio number of the cartesian product of a tree and a complete graph},
journal = {Congressus Numerantium},
year = {2025},
doi = {10.61091/cn235-05}
}
EUVIMED