On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes

DOI10.1007/s40065-019-00273-xzbMath1462.05361OpenAlexW2989712123MaRDI QIDQ2023761

Jack H. Koolen, Alexander L. Gavrilyuk

Publication date: 3 May 2021

Published in: Arabian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40065-019-00273-x

zbMATH Keywords

distance-transitive graphscompact symmetric spaces

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (1)

Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey

Uses Software

• sage-drg

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• Bipartite distance-transitive doubles with primitive halved of diameter two
• Antipodal distance-transitive covers with primitive quotient of diameter two
• Triple intersection numbers of \(Q\)-polynomial distance-regular graphs
• Extremal 1-codes in distance-regular graphs of diameter 3
• The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs
• Spectra of graphs
• The subconstituent algebra of an association scheme. I
• Finite primitive distance-transitive graphs
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• Imprimitive distance-transitive graphs with primitive core of diameter at least 3
• On the graphical characterization of the projective space over a finite field
• A class of distance-regular graphs that are \(\phi\)-polynomial
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• The association schemes of dual polar spaces of type \(^ 2A_{2d- 1}(p^ f)\) are characterized by their parameters if \(d\geq 3\)
• A characterization of the association schemes of bilinear forms
• Strongly regular graphs having strongly regular subconstituents
• Characterization of H(n,q) by the parameters
• Incidence structures whose planes are nets
• A characterization of the association schemes of Hermitian forms
• On nonsymmetric \(P\)- and \(Q\)-polynomial association schemes
• Improvement of Bruck's completion theorem
• The dual of Pasch's axiom
• Two remarks on Huang's characterization of the bilinear forms graphs
• Characterization of projective incidence structures
• Spherical codes and designs
• On a characterization of bilinear forms graphs
• A unified approach to a characterization of Grassmann graphs and bilinear forms graphs
• Characterization of the folded Johnson graphs of small diameter by their intersection arrays
• Imprimitive Q-polynomial association schemes
• On the characterization of the folded halved cubes by their intersection arrays
• A spectral characterization of the \(s\)-clique extension of the square grid graphs
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• Kite-free distance-regular graphs
• A characterization of Grassmann graphs
• Using symbolic computation to prove nonexistence of distance-regular graphs
• A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)
• Tridiagonal pairs and the quantum affine algebra \(U_q(\widehat{\text{sl}}_2)\).
• A new family of distance-regular graphs with unbounded diameter
• Two-point homogeneous spaces
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• Characerization of a class of distance regular graphs.
• Orthogonal Polynomials, Duality and Association Schemes
• Exceptional graphs with smallest eigenvalue -2 and related problems
• On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays

This page was built for publication: On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes