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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

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

Devsi Bantva, Payal Vasoya
Congressus Numerantium
Graph Labeling and Dimension Problems
article

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

Devsi Bantva, Payal Vasoya
article en

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.

Congressus NumerantiumVol. 238
Gujarat Technological University (IN)
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon