Graphs with fourth Laplacian eigenvalue less than two (Q1404994): Difference between revisions

Let \(G\) be a simple graph with vertex set \(V\) such that \(n=|V|\geq 4\). Denote by \(D(G)= \text{diag}(\deg_v, v\in V)\) and \(A(G)\) the degree diagonal and the adjacency matrices of \(G\), respectively. \(L(G)= D(G)- A(G)\) is called the Laplacian matrix of \(G\). Clearly, \(L(G)\) is a positive semidefinite matrix. So the eigenvalues of \(L(G)\) are denoted by \(\lambda_1(G)\geq \lambda_2(G)\geq \lambda_3(G)\geq \lambda_4(G)\geq\cdots\geq \lambda_n(G)\geq 0\). In this paper, all connected graphs \(G\) with \(\lambda_4(G)< 2\) are determined, and especially all connected graphs \(G\) with \(\lambda_3(G)\geq 2> \lambda_4(G)\) are characterized. Moreover, the author determines the bipartite graphs with the property that the adjacency matrix of their line graph has exactly three nonnegative eigenvalues.