Non-$\ell$-distance-balanced generalized Petersen graphs $GP(n,3)$ and $GP(n,4)$

Abstract

A connected graph $G$ of diameter $\mathrm{diam}(G)\ge \ell$ is $\ell$-distance-balanced if $|W_{xy}|=|W_{yx}|$ for every $x,y\in V(G)$ with $d_G(x,y)=\ell$, where $W_{xy}$ is the set of vertices of $G$ that are closer to $x$ than to $y$. We prove that the generalized Petersen graph $GP(n,3)$ where $n>16$ is not $\ell$-distance-balanced for any $1\le \ell <\mathrm{diam}(GP(n,3))$, and $GP(n,4)$ where $n>24$ is not $\ell$-distance-balanced for any $1\le \ell <\mathrm{diam}(GP(n,4))$. This partially solves a conjecture posed by Š. Miklavič and P. Šparl (Discrete Appl. Math. 244:143-154, 2018).

32