TY - JOUR
T1 - Kite-free P- and Q-polynomial schemes
AU - Weng, Chih-wen
PY - 1995/6
Y1 - 1995/6
N2 - Let Y = (X, {Ri}o≤i≤d) denote a P-polynomial association scheme. By a kite of length i (2 ≤ i ≤ d) in Y, we mean a 4-tuple xyzu (x, y, z, u ∈ X) such that (x, y) ∈ R1, (x, z) ∈ R1, (y, z) ∈ R1, (u, y) ∈ Ri-1, (u, z) ∈ Ri-1, (u, x) ∈ Ri. Our main result in this paper is the following.
AB - Let Y = (X, {Ri}o≤i≤d) denote a P-polynomial association scheme. By a kite of length i (2 ≤ i ≤ d) in Y, we mean a 4-tuple xyzu (x, y, z, u ∈ X) such that (x, y) ∈ R1, (x, z) ∈ R1, (y, z) ∈ R1, (u, y) ∈ Ri-1, (u, z) ∈ Ri-1, (u, x) ∈ Ri. Our main result in this paper is the following.
UR - http://www.scopus.com/inward/record.url?scp=19444381194&partnerID=8YFLogxK
U2 - 10.1007/BF01929487
DO - 10.1007/BF01929487
M3 - Article
AN - SCOPUS:19444381194
SN - 0911-0119
VL - 11
SP - 201
EP - 207
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
IS - 2
ER -