Some new aspects of main eigenvalues of graphs (Q2301013)

An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-orthogonal to the associated eigenspace. This paper explores some new aspects of the study of main eigenvalues of graphs, investigating specifically cones over strongly regular graphs for which the least eigenvalue is non-main. In particular, the authors characterized paths and trees of diameter three with non-main least eigenvalue. It is noted that the importance of least eigenvalues of graphs for the equilibria of social and economic networks has been recently uncovered in literature.