How many P-polynomial structures can an association scheme have?
From MaRDI portal
(Redirected from How many P-polynomial structures can an association scheme have?)
Cites work
- A new 5‐arc‐transitive cubic graph
- scientific article; zbMATH DE number 3471925 (Why is no real title available?)
- scientific article; zbMATH DE number 3492558 (Why is no real title available?)
- scientific article; zbMATH DE number 3521848 (Why is no real title available?)
- scientific article; zbMATH DE number 3601619 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
Cited in
(11)- Distance-transitive representations of the symmetric groups
- Association schemes and quadratic transformations for orthogonal polynomials
- Almost rank three graphs
- Association schemes with multiple Q-polynomial structures
- On strongly closed subgraphs of highly regular graphs
- Affine distance-transitive groups of dimension one
- A proof of a dodecahedron conjecture for distance sets
- Nonexistence of exceptional 5-class association schemes with two \(Q\)-polynomial structures
- Metrically homogeneous graphs of diameter \(3\)
- Twists and twistability
- A remark on association schemes with two P-polynomial structures
This page was built for publication: How many P-polynomial structures can an association scheme have?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151871)
