Graph representations, two-distance sets, and equiangular lines (Q2276977)

The author studies the representation of a graph with n vertices as a spherical 2-distance set in \(R^ n\). Representation parameters are related to the eigenvalues and eigenvectors of the adjacency matrix of the graph. Among other results it is shown that all sufficiently large sets of equiangular lines with mutual angle \(\arccos 1/5\) are known. [Reviewer's remark: The author's concept of t-height of a graph is, essentially, the generating function for the numbers of walks in a graph, which has been studied by the reviewer. Thus a part of the results in the present paper was, in fact, known before, see e.g. Sections 1.8 and 7.5 in the book by the reviewer, \textit{M. Doob} and \textit{H. Sachs}, ``Spectra of graphs. Theory and application'' (1980; Zbl 0458.05042).]