Abstract
Let G be a graph, $A(G)$ be the adjacency matrix of G, and $\lambda (G)$ the least eigenvalue of $A(G)$. Information is given about the following three quantities: \[\begin{aligned} \lambda _R (G) & = \mathop {\sup }\limits_{\substack{ H \supset G \\ H\,{\text{regular}} }} \lambda (H) \\ \mu (G) & = \mathop {\lim }\limits_{d \to \infty } \mathop {\sup }\limits_{\substack{ H \supset G \\ d(H) > d }} \mu (G) \\ \mu _R (G) & = \mathop {\lim }\limits_{d \to \infty } \mathop {\sup }\limits_{\substack{ H \supset G \\ H\,{\text{regular}} \\ d(H) > d }} \mu (G) \end{aligned} \]

This publication has 5 references indexed in Scilit: