Bose et al.'s maximum distance spectral radius conjecture for cacti
Let be the class of all cacti on vertices and cycles, where . Let denote the saw-graph obtained by joining an end of a proper saw-graph of length with an end of another proper saw-graph of length by a path of length .
Bose et al.'s conjecture. The graph
uniquely maximizes the distance spectral radius in .
This conjecture proposes the extremal cactus for each permitted number of vertices and cycles. The source presents it as a conjecture based on computer results; its resolution is not specified here.
References
Primary source
Yanna Wang and Bo Zhou, “A proof of a conjecture on the distance spectral radius”, arXiv:2303.09742 (2023).
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.