Twice Q-polynomial distance-regular graphs are thin
โ Scribed by Garth A Dickie
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 275 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let 1 denote a bipartite Q-polynomial distance-regular graph with diameter D 4. We show that 1 is the quotient of an antipodal distance-regular graph if and only if one of the following holds. (i) 1 is a cycle of even length. (ii) 1 is the quotient of the 2D-cube. 1999 Academic Press \* , ..., %\
i=0 the polynomials involved are orthogonal and we display the orthogonality relations. We also show that each of the sequences satisfy a three-term recurrence and a relation known as the Askey-Wilson duality. We then turn our attention to two more bases for W. We find the matrix representations of