The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding
Author:
- Alan J. HoffmanAHAlan J. Hoffman
- 1 July 1969
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 17 (4) , 664-671
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} \]
Keywords
This publication has 5 references indexed in Scilit:
- The interchange graph of a finite graphActa Mathematica Hungarica, 1965
- On the line graph of a symmetric balanced incomplete block designTransactions of the American Mathematical Society, 1965
- Strongly regular graphs, partial geometries and partially balanced designsPacific Journal of Mathematics, 1963
- Finite nets. II. Uniqueness and imbeddingPacific Journal of Mathematics, 1963
- The Uniqueness of the $\mathrm{L}_2$ Association SchemeThe Annals of Mathematical Statistics, 1959