Maxima of the Q-index: graphs without long paths

This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of graphs with no paths of given order. Thus, let S n,k be the join of a complete graph of order k and an independent set of order nk, and let S + n,k be the graph obtained by adding an edge to S n,k .