On the limit points of the smallest positive eigenvalues of graphs (Q6994748)

In this paper, the authors consider the question, Which real numbers are the limit points of the set of the smallest positive eigenvalues (respectively, the largest negative eigenvalues) of graphs?\N\NLet \(G\) be a simple undirected graph. Let \(\tau(G)\) and \(\nu(G)\) denote the smallest positive eigenvalue and the largest negative eigenvalue of \(G\), respectively. A real number \(r\) is called a limit point for smallest positive eigenvalues if there is a sequence of graphs \(\{G_{n}\}\) such that \(\{\tau(G_{n})\}\) converges to \(r\) and \(\tau(G_{n}) \neq \tau(G_{m})\) whenever \(n \neq m\). Let \N\[\N\mathcal{R}_{\tau} := \{\tau(G): G \in \mathcal{G}\}\N\]\Nand \N\[\N\mathcal{R}_{\nu} := \{\nu(G): G \in \mathcal{G}\},\N\]\Nwhere \(\mathcal{G}\) is the set of all connected graphs.\N\NThe authors prove that any nonnegative real number is a limit point of the set \(\mathcal{R}_{\tau}\) and any nonpositive real number is a limit point of the set \(\mathcal{R}_{\nu}\). Consequently, the set \(\mathcal{R}_{\tau} \cup \mathcal{R}_{\nu}\) is dense in \(\mathbb{R}\).