Three-Class Association Schemes

Authors:
Edwin R. Van Dam
Affiliations:
Tilburg University, Department of Econometrics, P.O. Box 90153, 5000 LE Tilburg, The Netherlands. Edwin.vanDam@kub.nl
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
1999

Citing 16
Cited 12

Design theory

Design theory
A (49, 16, 3, 6) strongly regular graph does not exist

European Journal of Combinatorics
Remarks on 2 - (15, 5, 4) designs

Coding theory and design theory: part II, design theory
On designs related to coherent configurations of type 22 4

Discrete Mathematics
A complete classification of symmetric (31, 10, 3) designs

Designs, Codes and Cryptography
Distance regular covers of the complete graph

Journal of Combinatorial Theory Series B
Reconstructing a Generalized Quadrangle from its Distance Two Association Scheme

Journal of Algebraic Combinatorics: An International Journal
There exists no distance-regular graph with intersection array (5,4,3;1,1,2)

European Journal of Combinatorics - Special issue: association schemes
Quasi-symmetric designs related to the triangular graph

Designs, Codes and Cryptography
A Family of Antipodal Distance-Regular Graphs Related to the Classical Preparata Codes

Journal of Algebraic Combinatorics: An International Journal
Construction and classification of combinatorial designs

Surveys in combinatorics, 1995
Spreads in Strongly Regular Graphs

Designs, Codes and Cryptography - Special issue dedicated to Hanfried Lenz
Association schemes

Handbook of combinatorics (vol. 1)
A Characterization of Distance-Regular Graphs with DiameterThree

Journal of Algebraic Combinatorics: An International Journal
From local adjacency polynomials to locally pseudo-distance-regular graphs

Journal of Combinatorial Theory Series B
Small regular graphs with four eigenvalues

Discrete Mathematics

Bounds on Special Subsets in Graphs, Eigenvalues and Association Schemes

Journal of Algebraic Combinatorics: An International Journal
The Search for Pseudo Orthogonal Latin Squares of OrderSix

Designs, Codes and Cryptography
Classification of association schemes of small order

Discrete Mathematics - The 2000 Com2MaC conference on association schemes, codes and designs
Characterizing distance-regularity of graphs by the spectrum

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Imprimitive cometric association schemes: Constructions and analysis

Journal of Algebraic Combinatorics: An International Journal
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration

European Journal of Combinatorics
Uniqueness of certain association schemes

European Journal of Combinatorics
On Boolean functions with the sum of every two of them being bent

Designs, Codes and Cryptography
Some implications on amorphic association schemes

Journal of Combinatorial Theory Series A
Cyclotomy over products of finite fields and combinatorial applications

European Journal of Combinatorics
Four-class skew-symmetric association schemes

Journal of Combinatorial Theory Series A
Linking systems in nonelementary abelian groups

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study (symmetric) three-class association schemes. Thegraphs with four distinct eigenvalues which are one of the relationsof such a scheme are characterized. We also give an overview of mostknown constructions, and obtain necessary conditions for existence. A list of feasible parameter sets on at most 100 vertices is generated.