On distance-balanced generalized Petersen graphs (Q6192076)

Let \(G\) be a graph. The usual shortest path distance is denoted by \(d(x,y)\) and \(W_{xy}\) is the set of all vertices that are closer to \(x\) than to \(y\) for any two different vertices \(x\) and \(y\). If \(|W_{xy}|=|W_{yx}|\) for any two different vertices \(x\) and \(y\) of \(G\) with \(d(x,y)=\ell\), then \(G\) is called an \(\ell\)-distance-balanced graph. The generalized Petersen graph \(P(n,k)\) is defined by \(V(P(n,k))=\{u_1,\dots,u_n\}\cup\{v_1,\dots,v_n\}\) and \(E(G)=\{u_iu_{i+1},u_iv_i,v_iv_{i+k}:i\in\{1,\dots,n\}\}\) where the addition is taken \(\pmod n\). The authors show that \(P(n,k)\) is \(\ell\)-distance-balanced for \(\ell\) being the diameter of \(P(n,k)\), providing that \(n\) is large enough with respect to \(k\). The diameter of \(P(n,k)\) is also considered.