The classification of distance-regular graphs of type IIB
From MaRDI portal
Publication:803168
DOI10.1007/BF02122560zbMath0727.05050OpenAlexW2079766641MaRDI QIDQ803168
Publication date: 1988
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02122560
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Related Items
A characterization of \(P\)- and \(Q\)-polynomial association schemes ⋮ P and Q polynomial schemes with \(q=-1\) ⋮ Classification of the family AT4(\(qs,q,q\)) of antipodal tight graphs ⋮ Distinguishing graphs via cycles ⋮ A new inequality for bipartite distance-regular graphs. ⋮ The subconstituent algebra of an association scheme. I ⋮ Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I ⋮ 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
- Characterization of H(n,q) by the parameters
- Root systems and the Johnson and Hamming graphs
- Characerization of a class of distance regular graphs.
- Some q-Krawtchouk Polynomials on Chevalley Groups
- Orthogonal Polynomials, Duality and Association Schemes
