Dual bipartite Q-polynomial distance-regular graphs

European Journal of Combinatorics

Volumn 17, Issue 7, 1996, Pages 613-623

  Dickie, Garth A ^a   Terwilliger, Paul M ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444437072     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0052     Document Type: Article

References (9)

1. E. Bannai and T. Ito, Algebraic Combinatorics I: Association Schemes, Benjamin/Cummings, Menlo Park, CA, 1984.
2. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-regular graphs, Springer-Verlag, Berlin 1989.
3. B. Curtin, A class of bipartite Q-polynomial distance-regular graphs, in preparation.
4. K. Nomura, Spin models on bipartite association schemes, preprint.
5. G. Szegö, Orthogonal Polynomials, 4th edn, Am. Math. Soc. Colloq. Publ., 23 (1975).
6. P. Terwilliger, The Johnson graph J(d, r) is unique if (d, r) ≠ (2, 8), Discr. Math., 58 (1986), 175-189.
7. P. Terwilliger, Root systems and the Johnson and Hamming graphs, Europ. J. Combin., 8 (1987), 73-102.
8. P. Terwilliger, Balanced sets and Q-polynomial association schemes, Graphs Combin., 4 (1988), 87-94.
9. P. Terwilliger, The subconstituent algebra of an association scheme, I, J. Alg. Combin., 1(4) (1992), 363-388.