Classification of partially metric Q-polynomial association schemes with m₁=4
From MaRDI portal
Publication:2657076
Abstract: We classify the Q-polynomial association schemes with which are partially metric with respect to the nearest neighbourhood relation. An association scheme is partially metric with respect to a relation if the scheme graph of is exactly the distance-2 graph of the scheme graph of under a certain ordering of the relations.
Recommendations
- Partially metric association schemes with a multiplicity three
- scientific article; zbMATH DE number 1373446
- On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
- On few-class \(Q\)-polynomial association schemes: feasible parameters and nonexistence results
- scientific article; zbMATH DE number 1043914
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3941600 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 1373446 (Why is no real title available?)
- Association schemes with multiple Q-polynomial structures
- Classification of association schemes of small order
- Coherent configurations. I
- Coherent configurations. I: Ordinary representation theory
- Constructions of maximum few-distance sets in Euclidean spaces
- Cubic Distance-Regular Graphs
- Fast generation of regular graphs and construction of cages
- Four-class skew-symmetric association schemes
- Locally homogeneous graphs from groups
- Nonexistence of exceptional 5-class association schemes with two \(Q\)-polynomial structures
- On primitive symmetric association schemes with \(m_1=3\)
- On symmetric association schemes with \(k_1=3\)
- Partially metric association schemes with a multiplicity three
- Spherical codes and designs
- Spherical embeddings of symmetric association schemes in 3-dimensional Euclidean space
- The distance-regular graphs of valency four
- The kissing number in four dimensions
- There are finitely many Q-polynomial association schemes with given first multiplicity at least three
- There are only finitely many distance-regular graphs of fixed valency greater than two
- Three-class association schemes
Cited in
(2)
This page was built for publication: Classification of partially metric Q-polynomial association schemes with \(m_1=4\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657076)