Non--distance-balanced generalized Petersen graphs GP(n,3) and GP(n,4)
Abstract
A connected graph G of diameter 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. We prove that the generalized Petersen graph GP(n,3) where n>16 is not -distance-balanced for any 1 < diam(GP(n,3)), and GP(n,4) where n>24 is not -distance-balanced for any 1 < diam(GP(n,4)). This partially solves a conjecture posed by S. Miklavic and P. Sparl (Discrete Appl. Math. 244:143-154, 2018).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.