signless Laplacian matrix;
eigenvalues;
join of graphs;
REGULAR GRAPHS;
D O I:
10.1080/03081087.2010.489900
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We investigate graphs whose signless Laplacian matrix has three distinct eigenvalues. We show that the largest signless Laplacian eigenvalue of a connected graph G with three distinct signless Laplacian eigenvalues is noninteger if and only if G = K-n - e for n >= 4, where K-n - e is the n vertex complete graph with an edge removed. Moreover, examples of such graphs are given in this article.