Photo from archive.org
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… Click to show full abstract
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 and graphs for which the least eigenvalue is non-main. In this case, we characterize paths and trees with diameter-3 satisfying the property. We may note that the importance of least eigenvalues of graphs for the equilibria of social and economic networks was recently uncovered in literature.
Journal Title: Computational and Applied Mathematics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!