← All problems

Cvetković–Rowlinson–Simić conjecture on the signless Laplacian spread

9 years old · traced to

Let sQ(G)s_Q(G) denote the difference between the largest and least eigenvalues of the signless Laplacian of a graph GG. Let Kn−1+K_{n-1}^+ be the graph obtained by adding a pendant edge to the complete graph Kn−1K_{n-1}; let PnP_n and CnC_n denote the path and cycle on nn vertices, respectively.

Cvetković–Rowlinson–Simić conjecture. Over all connected graphs on n≥6n\geq6 vertices, sQ(G)s_Q(G) is maximized by Kn−1+K_{n-1}^+ and minimized by PnP_n and, when nn is odd, by CnC_n.

The minimizing assertion was proved independently by Das and by Fan et al. The maximizing assertion was confirmed in this paper for sufficiently large nn.

References

2 papers in this index state this conjecture (2017–2022). The statement above is taken from the most recent of them; the others are arXiv:1709.00182.

Source: Lele Liu, “Two conjectures in spectral graph theory involving the linear combinations of graph eigenvalues”, arXiv:2206.03723 (2022).

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.