China
Eslovenia
A connected graph G with diam(G) ≥ ℓ is ℓ-distance-balanced if |Wxy| = |Wyx| for every x, y ∈ V (G) with dG(x, y) = ℓ, where Wxy is the set of vertices of G that are closer to x than to y. Miklaviˇc and Sparl [Discrete ˇ Appl. Math. 244 (2018), 143–154] conjectured that if n > nk, where nk = 11 if k = 2, nk = (k + 1)2 if k is odd, and nk = k(k + 2) if k ≥ 4 is even, then the generalized Petersen graph GP(n, k) is not ℓ-distance-balanced for any 1 ≤ ℓ < diam(GP(n, k)). In the seminal paper, the conjecture was verified for k = 2. In this paper we prove that the conjecture holds for k = 3 and for k = 4.
© 2008-2026 Fundación Dialnet · Todos los derechos reservados