The maximum clique and the signless Laplacian eigenvalues
Lower and upper bounds are obtained for the clique number and the independence number , in terms of the eigenvalues of the signless Laplacian matrix of a graph .
Lower and upper bounds are obtained for the clique number and the independence number , in terms of the eigenvalues of the signless Laplacian matrix of a graph .
Page 1