Bose et al.'s maximum distance spectral radius conjecture for cacti

About 3 years old · traced to

Let C(n,k)\mathcal{C}(n,k) be the class of all cacti on nn vertices and kk cycles, where 0≤k≤⌊n−12⌋0\leq k\leq\lfloor\frac{n-1}{2}\rfloor. Let S(p,q;ℓ)S(p,q;\ell) denote the saw-graph obtained by joining an end of a proper saw-graph of length pp with an end of another proper saw-graph of length qq by a path of length ℓ\ell.

Bose et al.'s conjecture. The graph

S(⌊k2⌋,⌈k2⌉;n−2k−1)S\left(\left\lfloor\frac{k}{2}\right\rfloor,\left\lceil\frac{k}{2}\right\rceil;n-2k-1\right)

uniquely maximizes the distance spectral radius in C(n,k)\mathcal{C}(n,k).

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

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.