Three-class association schemes
Journal of Algebraic Combinatorics, Tome 10 (1999) no. 1, pp. 69-107.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: We study (symmetric) three-class association schemes. The graphs with four distinct eigenvalues which are one of the relations of such a scheme are characterized. We also give an overview of most known constructions, and obtain necessary conditions for existence. A list of feasible parameter sets on at most 100 vertices is generated.
Keywords: association scheme, graph, eigenvalue
@article{JAC_1999__10_1_a0,
     author = {van Dam, Edwin R.},
     title = {Three-class association schemes},
     journal = {Journal of Algebraic Combinatorics},
     pages = {69--107},
     publisher = {mathdoc},
     volume = {10},
     number = {1},
     year = {1999},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JAC_1999__10_1_a0/}
}
TY  - JOUR
AU  - van Dam, Edwin R.
TI  - Three-class association schemes
JO  - Journal of Algebraic Combinatorics
PY  - 1999
SP  - 69
EP  - 107
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JAC_1999__10_1_a0/
LA  - en
ID  - JAC_1999__10_1_a0
ER  - 
%0 Journal Article
%A van Dam, Edwin R.
%T Three-class association schemes
%J Journal of Algebraic Combinatorics
%D 1999
%P 69-107
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JAC_1999__10_1_a0/
%G en
%F JAC_1999__10_1_a0
van Dam, Edwin R. Three-class association schemes. Journal of Algebraic Combinatorics, Tome 10 (1999) no. 1, pp. 69-107. http://geodesic.mathdoc.fr/item/JAC_1999__10_1_a0/