Work

Radio antipodal number for the Cartesian product of a complete graph and a path

Year: 2026
Type: article
Abstract: 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.
Language: English
Open Access status: hybrid
OpenAlex ID: W7233590153
FWCI:
Cites:
Cited by:
Related to: