Showing papers on "Spectral graph theory published in 1974"
01 Jan 1974
TL;DR: In this paper, the eigenvalues of a graph are computed by searching for p orthogonal eigenvectors, determining the first p moments by counting closed walks and then finding the spectrum from the moments, or using certain subgraphs to determine the coefficients of the characteristic polynomial.
Abstract: How can one actually compute the eigenvalues of a graph? In principal, there are three methods. Namely, (1) we can search for p orthogonal eigenvectors, (2) we can determine the first p moments by counting closed walks and then find the spectrum from the moments, or (3) we can use certain subgraphs to determine the coefficients of the characteristic polynomial and then find its roots.
349 citations