In 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.
科研之友
微信
新浪微博
Facebook
分享链接
