Signless Laplacian spectral radius and matching in graphs

Chang Liu, Yingui Pan, Jianping Li

The signless Laplacian matrix of a graph $G$ is given by $Q(G)=D(G)+A(G)$, where $D(G)$ is a diagonal matrix of vertex degrees and $A(G)$ is the adjacency matrix. The largest eigen…