On distance-balanced generalized Petersen graphs

TL;DR

This paper investigates the distance-balanced properties of generalized Petersen graphs, proving that for sufficiently large n relative to k, these graphs are distance-balanced at their diameter and determining their diameter.

Contribution

It proves that generalized Petersen graphs are diameter-distance-balanced for large n relative to k and determines their diameter in this regime, partially confirming a prior conjecture.

Findings

GP(n,k) is diameter-distance-balanced for large n relative to k

The diameter of GP(n,k) is determined for large n

Partial confirmation of Miklavič and Šparl's conjecture

Abstract

A connected graph $G$ of diameter ${\rm 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,k)$ is ${\rm diam}(GP(n,k))$-distance-balanced provided that $n$ is large enough relative to $k$. This partially solves a conjecture posed by Miklavi\v{c} and \v{S}parl \cite{Miklavic:2018}. We also determine ${\rm diam}(GP(n,k))$ when $n$ is large enough relative to $k$.