Distance-Regular Graphs with an Eigenval
โ
R.R. Zhu
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 939 KB
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