On the Uniqueness of the Triangular Association Scheme

Cited in

(28)

The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
A survey of some problems in combinatorial designs - a matrix approach
Characterization theorems for Zara graphs
A surprising property of the least eigenvalue of a graph
Partitions in matrices and graphs
On quasi-symmetric designs
Strongly regular graphs
On the uniqueness of the tetrahedral association schemes
Quasi-symmetric designs related to the triangular graph
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
On partial geometries arising from maximal arcs
Amply regular graphs with Hoffman's condition
The smallest strictly Neumaier graph and its generalisations
Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
Characterization of families of rank 3 permutation groups by the subdegrees. I
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
Graphs identified by logics with counting
On the line graph of the complete tripartite graph
On the Line Graph of a Projective Plane
On classification of two class partially balanced designs
Cospectral mates for generalized Johnson and Grassmann graphs
Graphes liés aux espaces polaires
The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
Strongly regular graphs with Hoffman's condition

This page was built for publication: On 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 Q3266750)