Skip to main content
broken link fixed, cf. https://math.meta.stackexchange.com/a/34713/228959
Source Link
Glorfindel
  • 2.8k
  • 6
  • 28
  • 38

I found a reference that seems to answer your question:

Shearer, James B. On the distribution of the maximum eigenvalue of graphsOn the distribution of the maximum eigenvalue of graphs, 1989. The theorem in this paper is that the set of largest eigenvalues of adjacency matrices of graphs is dense in the interval $\left[\sqrt{2+\sqrt{5}},\infty\right)$. Here's an online version.


Here's a related paper:

Hoffman, Alan J. On limit points of spectral radii of non-negative symmetric integral matricesOn limit points of spectral radii of non-negative symmetric integral matrices, 1972. In this paper limit points less than $\sqrt{2+\sqrt{5}}$ are described. In particular, they form an increasing sequence starting at 2 and converging to $\sqrt{2+\sqrt{5}}$. Here's an online versionHere's an online version. The author also posed the problem that led to Shearer's paper.

I found a reference that seems to answer your question:

Shearer, James B. On the distribution of the maximum eigenvalue of graphs, 1989. The theorem in this paper is that the set of largest eigenvalues of adjacency matrices of graphs is dense in the interval $\left[\sqrt{2+\sqrt{5}},\infty\right)$. Here's an online version.


Here's a related paper:

Hoffman, Alan J. On limit points of spectral radii of non-negative symmetric integral matrices, 1972. In this paper limit points less than $\sqrt{2+\sqrt{5}}$ are described. In particular, they form an increasing sequence starting at 2 and converging to $\sqrt{2+\sqrt{5}}$. Here's an online version. The author also posed the problem that led to Shearer's paper.

I found a reference that seems to answer your question:

Shearer, James B. On the distribution of the maximum eigenvalue of graphs, 1989. The theorem in this paper is that the set of largest eigenvalues of adjacency matrices of graphs is dense in the interval $\left[\sqrt{2+\sqrt{5}},\infty\right)$. Here's an online version.


Here's a related paper:

Hoffman, Alan J. On limit points of spectral radii of non-negative symmetric integral matrices, 1972. In this paper limit points less than $\sqrt{2+\sqrt{5}}$ are described. In particular, they form an increasing sequence starting at 2 and converging to $\sqrt{2+\sqrt{5}}$. Here's an online version. The author also posed the problem that led to Shearer's paper.

added statement of theorem in second paper
Source Link
Jonas Meyer
  • 7.3k
  • 2
  • 43
  • 50

I found a reference that seems to answer your question:

Shearer, James B. On the distribution of the maximum eigenvalue of graphs, 1989. The theorem in this paper is that the set of largest eigenvalues of adjacency matrices of graphs is dense in the interval $\left[\sqrt{2+\sqrt{5}},\infty\right)$. Here's an online version.


Here's a related paper:

Hoffman, Alan J. On limit points of spectral radii of non-negative symmetric integral matrices, 1972. In this paper limit points less than $\sqrt{2+\sqrt{5}}$ are studieddescribed. In particular, they form an increasing sequence starting at 2 and converging to (I do not know the details$\sqrt{2+\sqrt{5}}$.)   Here's an online version. The author also posed the problem that led to Shearer's paper.

I found a reference that seems to answer your question:

Shearer, James B. On the distribution of the maximum eigenvalue of graphs, 1989. The theorem in this paper is that the set of largest eigenvalues of adjacency matrices of graphs is dense in the interval $\left[\sqrt{2+\sqrt{5}},\infty\right)$. Here's an online version.


Here's a related paper:

Hoffman, Alan J. On limit points of spectral radii of non-negative symmetric integral matrices, 1972. In this paper limit points less than $\sqrt{2+\sqrt{5}}$ are studied. (I do not know the details.) Here's an online version. The author also posed the problem that led to Shearer's paper.

I found a reference that seems to answer your question:

Shearer, James B. On the distribution of the maximum eigenvalue of graphs, 1989. The theorem in this paper is that the set of largest eigenvalues of adjacency matrices of graphs is dense in the interval $\left[\sqrt{2+\sqrt{5}},\infty\right)$. Here's an online version.


Here's a related paper:

Hoffman, Alan J. On limit points of spectral radii of non-negative symmetric integral matrices, 1972. In this paper limit points less than $\sqrt{2+\sqrt{5}}$ are described. In particular, they form an increasing sequence starting at 2 and converging to $\sqrt{2+\sqrt{5}}$.  Here's an online version. The author also posed the problem that led to Shearer's paper.

Source Link
Jonas Meyer
  • 7.3k
  • 2
  • 43
  • 50

I found a reference that seems to answer your question:

Shearer, James B. On the distribution of the maximum eigenvalue of graphs, 1989. The theorem in this paper is that the set of largest eigenvalues of adjacency matrices of graphs is dense in the interval $\left[\sqrt{2+\sqrt{5}},\infty\right)$. Here's an online version.


Here's a related paper:

Hoffman, Alan J. On limit points of spectral radii of non-negative symmetric integral matrices, 1972. In this paper limit points less than $\sqrt{2+\sqrt{5}}$ are studied. (I do not know the details.) Here's an online version. The author also posed the problem that led to Shearer's paper.