P and Q polynomial schemes with \(q=-1\)

DOI10.1016/0095-8956(87)90063-3zbMath0675.05016OpenAlexW1966786589MaRDI QIDQ1121894

Paul M. Terwilliger

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90063-3

zbMATH Keywords

distance-regular graphsintersection numbersQ-polynomial property

Mathematics Subject Classification ID

Other designs, configurations (05B30) Structural characterization of families of graphs (05C75)

Related Items

Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets, On relative \(t\)-designs in polynomial association schemes, \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one, A new inequality for bipartite distance-regular graphs., The subconstituent algebra of an association scheme. I, The Terwilliger algebra of an almost-bipartite \(P\)- and \(Q\)-polynomial association scheme, TD-pairs and the $q$-Onsager algebra, The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameters of association schemes that are both P- and Q-polynomial
• The classification of distance-regular graphs of type IIB
• A characterization of \(P\)- and \(Q\)-polynomial association schemes
• Characterization of H(n,q) by the parameters
• Characterization of the odd graphs \(O_ k \)by parameters
• Root systems and the Johnson and Hamming graphs
• Distance-regular graphs and (s,c,a,k)-graphs
• Characerization of a class of distance regular graphs.