Minimum values of the second largest \(Q\)-eigenvalue (Q2243135)

Graphs with small values of the second largest signless Laplacian eigenvalue \(q_2\) are considered in the article. Connected (simple) graphs on at least seven vertices satisfying \(q_2 \leq 3\) were completely characterised by \textit{M. Aouchiche} et al. [Linear Algebra Appl. 435, No. 10, 2591--2606 (2011; Zbl 1222.05146)]. Their result also involves, for each \(n \geq 7\), a characterisation of graphs of order \(n\) attaining the three smallest values of \(q_2\) possible for such graphs. The authors prove a strengthening of this result, in which they explicitly characterise the connected graphs on \(n\) vertices with the five smallest values of \(q_2\) possible for graphs of order \(n\) (provided \(n \geq 7\)). Their main result can thus be described as identifying the graphs with the fourth and fifth smallest value of \(q_2\) among graphs of a given order. This is further equivalent to determining, for which of the firefly graphs with one triangle the value \(q_2\) attains its smallest and second smallest possible value.