Tight distance-regular graphs and the Q-polynomial property

Graphs and Combinatorics

Volumn 17, Issue 1, 2001, Pages 149-169

  Pascasio, Arlene A ^a  

^a DE LA SALLE UNIVERSITY   (Philippines)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347957326     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730170063     Document Type: Article

References (8)

1. Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes. (Benjamin-Cummings Lecture Note Ser. 58) Benjamin-Cummings Menlo Park CA 1984
2. Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer New York 1989
3. Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall New York 1993
4. Jurišić, A., Koolen, J., Terwilliger, P.M.: Tight distance-regular graphs. J. Algebraic Comb. 12, 163-197 (2000)
5. Lang, M.: A new inequality for bipartite distance-regular graphs (preprint)
6. Pascasio, A.A.: Tight graphs and their primitive idempotents. J. Algebraic Comb. 10, 47-59 (1999)
7. Terwilliger, P.M.: The subconstituent algebra of an association scheme, I. J. Algebraic Comb. 1, 363-388 (1992)
8. Terwilliger, P.M.: A new inequality for distance-regular graphs. Discrete Math. 37, 319-332 (1995)