Radio antipodal number for the Cartesian product of a complete graph and a path
Congressus Numerantium · 15.11.2026 · 238 · 143-160
DOI: 10.61091/cn238-08 ↗Kurz gefasst
Fachartikel in der Zeitschrift Congressus Numerantium, online erschienen am 15.11.2026. Verfasst von Payal Vasoya und 1 weiteren Autor:innen.
Abstract (Originalsprache)
A radio antipodal labeling of a graph \(G\) is a function \(f\) that assigns a non negative integer to each vertex in such a way that for any pair of distinct vertices \(x\) and \(y\), the condition \(|f(x)-f(y)| \geq d-d(x,y)\) is satisfied, where \(d\) and \(d(x,y)\) represent the diameter of graph \(G\), and distance between \(x\) and \(y\) in graph \(G\), respectively. The span of radio antipodal labeling \(f\) is defined as \(\span(f) = \max\{|f(x)-f(y)| : x,y \in V(G)\}\). The radio antipodal number of graph \(G\), denoted by \(\an(G)\), is defined as \(\an(G) := \min_{f}\{\span(f)\}\) with minimum taken over all radio antipodal labelings \(f\) of \(G\). A radio antipodal labeling \(f\) of \(G\) is optimal if \(\span(f) = \an(G)\). In this paper, we give the exact radio antipodal number of the Cartesian product of a complete graph and a path.
Zitieren
APA
Vasoya, P., & Bantva, D. (2026). Radio antipodal number for the Cartesian product of a complete graph and a path. Congressus Numerantium, 238, 143-160. https://doi.org/10.61091/cn238-08
Vancouver
Vasoya P, Bantva D. Radio antipodal number for the Cartesian product of a complete graph and a path. Congressus Numerantium. 2026;238:143-160. doi:10.61091/cn238-08
BibTeX
@article{Vasoya2026,
author = {Vasoya, Payal and Bantva, Devsi},
title = {Radio antipodal number for the Cartesian product of a complete graph and a path},
journal = {Congressus Numerantium},
year = {2026},
volume = {238},
pages = {143--160},
doi = {10.61091/cn238-08}
}
EUVIMED