1. On Distance-Balanced Generalized Petersen Graphs.
- Author
-
Ma, Gang, Wang, Jianfeng, and Klavžar, Sandi
- Subjects
PETERSEN graphs ,GRAPH connectivity ,DIAMETER ,MATHEMATICS - Abstract
A connected graph G of diameter diam (G) ≥ ℓ is ℓ -distance-balanced if | W xy | = | W yx | for every x , y ∈ V (G) with d G (x , y) = ℓ , 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 diam (G P (n , k)) -distance-balanced provided that n is large enough relative to k. This partially solves a conjecture posed by Miklavič and Šparl (Discrete Appl Math 244:143–154, 2018). We also determine diam (G P (n , k)) when n is large enough relative to k. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF