The signless Laplacian spectral radius of a graph
is the largest eigenvalue of
its signless Laplacian matrix
.
Li et al. (2026) study the maximum of among graphs of fixed edge
count that contain a prescribed induced subgraph
. They prove the proposed extremal form when the edge count is at least
, and also when
is a path graph, cycle
graph, or complete graph.