An Inequality Involving the Local Eigenvalues of a Distance-Regular Graph
โ Scribed by Paul Terwilliger
- Book ID
- 111587716
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 224 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0925-9899
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let \(G\) be a distance-regular graph. If \(G\) has an eigenvalue \(\theta\) of multiplicity \(m\) \((\geqslant 2)\), then \(G\) has a natural representation in \(R^{m}\). By studying the geometric properties of the image configuration in \(R^{m}\), we can obtain considerable information about the g
In this paper, we consider a bipartite distance-regular graph = (X, E) with diameter d โฅ 3. We investigate the local structure of , focusing on those vertices with distance at most 2 from a given vertex x. To do this, we consider a subalgebra R = R(x) of Mat X (C), where X denotes the set of vertice