Radio antipodal number for the Cartesian product of a complete graph and a path
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.
Authors
- Devsi Bantva (ORCID: https://orcid.org/0000-0002-5053-8955)
- Payal Vasoya (ORCID: https://orcid.org/0009-0006-0772-9058)
Institutions
- Gujarat Technological University (IN)
Publication Details
- Journal
- Congressus Numerantium
- Published
- 2026-11-15
- DOI
- https://doi.org/10.61091/cn238-08
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00