AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of a symmetric association scheme with two classes. In this paper we show that this scheme is not the closure of any non-symmetric association scheme with three classes.This implies that no primitive non-symmetric association schemes with three classes on 16 elements exist
We classify primitive symmetric association schemes with m_1 = 3. Namely, it is shown that the tetr...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
An association scheme (Q,[Gamma]), comprising a certain kind of partition [Gamma] of the direct squa...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
AbstractIn this paper we enumerate essentially all non-symmetric association schemes with three clas...
AbstractIn this paper we present a classification into three categories of the imprimitive non-symme...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...
AbstractIn this paper a set of necessary conditions for the existence of a non-symmetric 3-class ass...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
An association scheme (Q,[Gamma]), comprising a certain kind of partition [Gamma] of the direct squa...
In this thesis we study imprimitive symmetric association schemes of rank 4 which are not wreath pro...
A construction of a pair of strongly regular graphs Γn and Γ'n of type L 2n-1 (4n-1) from a pair of ...
A construction of a pair of strongly regular graphs Γn and Γ'n of type L 2n-1 (4n-1) from a pair of ...
We classify primitive symmetric association schemes with m_1 = 3. Namely, it is shown that the tetr...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
An association scheme (Q,[Gamma]), comprising a certain kind of partition [Gamma] of the direct squa...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
AbstractIn this paper we enumerate essentially all non-symmetric association schemes with three clas...
AbstractIn this paper we present a classification into three categories of the imprimitive non-symme...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...
AbstractIn this paper a set of necessary conditions for the existence of a non-symmetric 3-class ass...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
An association scheme (Q,[Gamma]), comprising a certain kind of partition [Gamma] of the direct squa...
In this thesis we study imprimitive symmetric association schemes of rank 4 which are not wreath pro...
A construction of a pair of strongly regular graphs Γn and Γ'n of type L 2n-1 (4n-1) from a pair of ...
A construction of a pair of strongly regular graphs Γn and Γ'n of type L 2n-1 (4n-1) from a pair of ...
We classify primitive symmetric association schemes with m_1 = 3. Namely, it is shown that the tetr...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
An association scheme (Q,[Gamma]), comprising a certain kind of partition [Gamma] of the direct squa...
DOI
Add to ORKG