Bollobás–Nikiforov signless Laplacian conjecture for clique-free graphs
Bollobás–Nikiforov signless Laplacian conjecture for clique-free graphs
Let be a graph containing no copy of , and let be its number of edges. Write for the signless Laplacian spectral radius. Bollobás–Nikiforov conjecture. One has
This is the signless Laplacian analogue of the corresponding adjacency spectral-radius bound for -free graphs; the source gives no resolution of the conjecture.
Sources & referencesView supporting material
Primary source
Yongtao Li, Weijun Liu and Lihua Feng, “A survey on spectral conditions for some extremal graph problems”, arXiv:2111.03309 (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
Sign in to submit a solution.
No solutions have been posted yet.