The Uniqueness of the Triangular Association Scheme
From MaRDI portal
Cited in
(19)- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- Uniqueness and nonexistence of some graphs related to \(M_{22}\)
- A directed graph version of strongly regular graphs
- On quasi-symmetric designs
- Strongly regular graphs
- Characterization of certain incomplete block designs
- Cospectral mates for the union of some classes in the Johnson association scheme
- Root systems and the Johnson and Hamming graphs
- On the uniqueness of the graphs G(n,k) of the Johnson schemes
- Embedding the complement of an oval in a projective plane of even order
- Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs
- The smallest strictly Neumaier graph and its generalisations
- A characterization of a class of regular graphs
- Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
- On the Line Graph of a Projective Plane
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- On classification of two class partially balanced designs
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
- Characters of finite quasigroups. VI: Critical examples and doubletons
This page was built for publication: The Uniqueness of the Triangular Association Scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3256620)
