A note on the distance-balanced property of generalized Petersen graphs (Q2380223): Difference between revisions

Summary: A graph \(G\) is said to be distance-balanced if for any edge \(uv\) of \(G\), the number of vertices closer to \(u\) than to \(v\) is equal to the number of vertices closer to \(v\) than to \(u\). Let GP \((n, k)\) be a generalized Petersen graph. \textit{J. Jerebic}, \textit{S. Klavžar}, and \textit{D.F. Rall} [``Distance-balanced graphs'', Ann. Comb. 12, No.\,1, 71--79 (2008; Zbl 1154.05026)] conjectured that: For any integer \(k\geqslant 2\), there exists a positive integer \(n_0\) such that the GP \((n, k)\) is not distance-balanced for every integer \(n \geqslant n_0\). In this note, we give a proof of this conjecture.