Distance-regular graphs, the subconstituent algebra, and the $Q$-polynomial property

DOI10.1017/9781009338073.012arXiv2207.07747OpenAlexW4390599607MaRDI QIDQ6405131

Paul M. Terwilliger

Publication date: 15 July 2022

Full work available at URL: https://doi.org/10.1017/9781009338073.012

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Combinatorial aspects of groups and algebras (05E16)

Related Items (6)

On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph ⋮ Eigenbasis for a weighted adjacency matrix associated with the projective geometry \(B_q (n)\) ⋮ Projective geometries, \(Q\)-polynomial structures, and quantum groups ⋮ Terwilliger algebras constructed from Cayley tables of finite Bol loops ⋮ Spin models and distance-regular graphs of \(q\)-Racah type ⋮ Bivariate \(P\)- and \(Q\)-polynomial structures of the association schemes based on attenuated spaces

This page was built for publication: Distance-regular graphs, the subconstituent algebra, and the $Q$-polynomial property