On a conjecture concerning antipodal labelings for cycles

Abstract

Let $G$ denote a finite, connected, simple graph, and let $D$ denote its diameter, and let $d_G(u,v)$ denote the distance between vertices $u$ and $v$ in $V(G)$. An antipodal labeling of $G$ is a mapping $f:V(G)\to {\mathbb{N}}_0$ such that, for each pair $(u,v)$ consisting of distinct vertices in $V(G)$, the relation $|f(u)-f(v)|\ge D-d_G(u,v)$ holds. The span of $f$ is then defined so that $\mathrm{sp}(f)=\max \{f(u)-f(v):u,v\in V(G)\}$. The antipodal number of $G$, denoted with $\mathrm{an}(G)$, may then be defined as the minimum possible span among all antipodal labelings of $G$. Juan and Liu [Ars Combin., 2012] proved the upper bound $\mathrm{an}(C_{4k})\le 2k^2-1$, and conjectured that $\mathrm{an}(C_{4k})=2k^2-1$ for each positive integer $k$, and Juan and Liu verified this conjecture for $k\le 5$. We succeed in proving Juan and Liu's conjecture, which seems to have remained open. The openness of Juan and Liu's conjecture has been noted, over the years, by many authors, including Rao et al. [Contrib. Discrete Math., 2015] and Saha et al. [Theory Comput. Syst., 2022].

arXiv commentSubmitted for publication