Maden (Gungor), A. DilekCevik, A. Sinan2020-03-262020-03-2620121537-9582https://hdl.handle.net/20.500.12395/27667In this paper, lower and upper bounds for the clique and independence numbers are established in terms of the eigenvalues of the signless Laplacian matrix of a given graph G.eninfo:eu-repo/semantics/openAccessClique and independence numbersSignless Laplacian eigenvaluesArticle23164170N/AWOS:000307047100004Q2