Some Elementary Inequalities For Distance-regular Graphs
β Scribed by Ernst Lambeck
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 21 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A spin model is a square matrix W satisfying certain conditions which ensure that it yields an invariant of knots and links via a statistical mechanical construction of V. F. R. Jones. Recently F. Jaeger gave a topological construction for each spin model W of an association scheme which contains W
We introduce the retracing argument for distance-regular graphs and prove several results by applying this argument.
We find an inequality involving the eigenvalues of a regular graph; equality holds if and only if the graph is strongly regular. We apply this inequality to the first subconstituents of a distance-regular graph and obtain a simple proof of the fundamental bound for distance-regular graphs, discovere