On a Characterization of the Triangular Association Scheme
From MaRDI portal
Cited in
(14)- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- A directed graph version of strongly regular graphs
- A note on cospectral graphs
- On quasi-symmetric designs
- Root systems and the Johnson and Hamming graphs
- Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
- 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
- On the Line Graph of a Projective Plane
- 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: On a Characterization of the Triangular Association Scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3262640)
