Abstract
LetY = (X, {R i } o≤i≤d) denote aP-polynomial association scheme. By a kite of lengthi (2 ≤ i ≤ d) inY, we mean a 4-tuplexyzu (x, y, z, u ∈ X) such that(x, y) ∈ R 1,(x, z) ∈ R 1,(y, z) ∈ R 1,(u, y) ∈ R i−1,(u, z) ∈ R i−1,(u, x) ∈ R i. Our main result in this paper is the following.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bannai, E., Ito, T.: Algebraic Combinatorics: Association Schemes, Benjamin-Cummings Lecture Note 58. Menlo Park (1984)
Brouwer, A., Cohen, A., Neumaier, A.: Distance-Regular Graphs, Springer Verlag, New York (1989)
Terwilliger, P.: The subconstituent algebra of an association scheme, I. J. Alg. Combin.1, 363–388 (1992)
Terwilliger, P.: A New Inequality for Distance-Regular Graphs. Discrete Math, 319–332 (1995)
Terwilliger, P.: Kite-Free Distance-Regular Graphs. Europ. J. Combin (to be published)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Weng, CW. Kite-freeP- andQ-polynomial schemes. Graphs and Combinatorics 11, 201–207 (1995). https://doi.org/10.1007/BF01929487
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01929487