AbstractIn this paper we enumerate essentially all non-symmetric association schemes with three classes, less than 96 vertices and with a regular group of automorphisms. The enumeration is based on a computer search in Schur rings. The most interesting cases have 64 vertices.In one primitive case and in one imprimitive case where no association scheme was previously known we find several new association schemes. In one other imprimitive case with 64 vertices we find association schemes with an automorphism group of rank 4, which was previously assumed not to be possible
For any finite group G, and any positive integer n, we construct an association scheme which admits ...
We study (symmetric) three-class association schemes.The graphs with four distinct eigenvalues which...
AbstractIn this paper we survey the recent developments in the theory of Schur rings and its applica...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...
AbstractIn this paper we enumerate essentially all non-symmetric association schemes with three clas...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
AbstractIn this paper we present a classification into three categories of the imprimitive non-symme...
We classify primitive symmetric association schemes with m_1 = 3. Namely, it is shown that the tetr...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...
AbstractIn this paper we determine all symmetric and non-symmetric 3-class association schemes such ...
A wreath product is a method to construct an association scheme from two association schemes. We det...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...
AbstractLetnbe a non-zero positive integer and Λ(n) the set of all partitions ofn. There is a one-to...
For any finite group G, and any positive integer n, we construct an association scheme which admits ...
We study (symmetric) three-class association schemes.The graphs with four distinct eigenvalues which...
AbstractIn this paper we survey the recent developments in the theory of Schur rings and its applica...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...
AbstractIn this paper we enumerate essentially all non-symmetric association schemes with three clas...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
AbstractIn this paper we present a classification into three categories of the imprimitive non-symme...
We classify primitive symmetric association schemes with m_1 = 3. Namely, it is shown that the tetr...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...
AbstractIn this paper we determine all symmetric and non-symmetric 3-class association schemes such ...
A wreath product is a method to construct an association scheme from two association schemes. We det...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...
AbstractLetnbe a non-zero positive integer and Λ(n) the set of all partitions ofn. There is a one-to...
For any finite group G, and any positive integer n, we construct an association scheme which admits ...
We study (symmetric) three-class association schemes.The graphs with four distinct eigenvalues which...
AbstractIn this paper we survey the recent developments in the theory of Schur rings and its applica...