scientific article; zbMATH DE number 3145665

Cited in

(32)

The Johnson graph $J(d,r)$ is unique if $(d,r)\neq (2,8)$
Permanental polynomials of graphs
Strongly regular graphs
Quasi-symmetric designs related to the triangular graph
On graphs with three eigenvalues
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
A spectral characterization of the $s$-clique extension of the triangular graphs
Semidefinite programming and eigenvalue bounds for the graph partition problem
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
Designs associated with maximum independent sets of a graph
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
Graphs identified by logics with counting
Notes on simplicial rook graphs
A note on order and eigenvalue multiplicity of strongly regular graphs
Exceptional graphs with smallest eigenvalue -2 and related problems
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
On the Line Graph of a Projective Plane
On classification of two class partially balanced designs
Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs
Cospectral mates for generalized Johnson and Grassmann graphs
Uniqueness of an association scheme related to the Witt design on 11 points
Using a Grassmann graph to recover the underlying projective geometry
Infinite families of directed strongly regular graphs using equitable partitions
Graphes liés aux espaces polaires
The graphs G(n,k) of the Johnson schemes are unique for n$\geq 20$

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3262641)