Jerebic's eventual non-distance-balancedness conjecture for generalized Petersen graphs
Let and . The generalized Petersen graph has vertex set
and edge set
Jerebic's conjecture. For any , there exists a positive integer such that is not distance-balanced for every . The conjecture was positively resolved by Yang et al.; in fact, if and , then is not distance-balanced.
References
Status
- Solved: Rui Yang, Xinmin Hou, Ning Li, and Wei Zhong. A Note on the Distance-Balanced Property of Generalized Petersen Graphs (The Electronic Journal of Combinatorics, 2009) https://www.combinatorics.org/ojs/index.php/eljc/article/view/v16i1n33
Source: Gang Ma, Jianfeng Wang and Sandi Klavžar, “On \1,2\-distance-balancedness of generalized Petersen graphs”, arXiv:2407.02635 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.