Bounded diameter conjecture for connected proper power graphs
For a finite group , let denote its proper power graph, and suppose that this graph is connected. Bounded diameter conjecture. There exists a constant such that, for every finite group with connected proper power graph,
The preceding results on proper power graphs of finite groups motivate this uniform boundedness question; the conjecture asserts that connected proper power graphs have diameters bounded independently of the group.
References
Primary source
Alireza Doostabadi and Mohammad Farrokhi Derakhshandeh Ghouchan, “On the connectivity of proper power graphs of finite groups”, arXiv:1401.6760 (2014).
Progress summary
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.