Add to ORKGWe classify primitive symmetric association schemes with m_1 = 3. Namely, it is shown that the tetrahedron, i.e., the association scheme of the complete graph K_4, is the unique such association scheme. Our proof of this result is based on the spherical embeddings of association schemes and elementary three dimensional Euclidean geometry
AbstractIn [5], Mathon described a pseudocyclic symmetric 3-class association scheme on 28 points. I...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...
We classify primitive symmetric association schemes with m_1 = 3. Namely, it is shown that the tetr...
AbstractLet V be the set of (34) 3- sets in {1 … n}. Say p, q ∈ V are ith associates, (p, q) ∈ Ai, i...
AbstractLet V be the set of (34) 3- sets in {1 … n}. Say p, q ∈ V are ith associates, (p, q) ∈ Ai, i...
AbstractWe prove the uniqueness of the two association schemes which appear in recent work of Henry ...
P(論文)"Let Ω = (X, {R_i}_) be commutative association scheme with class d. F_i, is a graph with respe...
We study (symmetric) three-class association schemes.The graphs with four distinct eigenvalues which...
AbstractIn this paper we construct a primitive, non-symmetric 3-class association scheme with parame...
AbstractIn this paper we construct a primitive, non-symmetric 3-class association scheme with parame...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
AbstractLet (X,G) be a primitive commutative association scheme. If g∈G is nonsymmetric of valency 4...
AbstractA primitive symmetric association scheme of class 2 is naturally embedded as a two-distance ...
The work of classification of association schemes began in [2] is continued. The assumption of $m_{1...
AbstractIn [5], Mathon described a pseudocyclic symmetric 3-class association scheme on 28 points. I...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...
We classify primitive symmetric association schemes with m_1 = 3. Namely, it is shown that the tetr...
AbstractLet V be the set of (34) 3- sets in {1 … n}. Say p, q ∈ V are ith associates, (p, q) ∈ Ai, i...
AbstractLet V be the set of (34) 3- sets in {1 … n}. Say p, q ∈ V are ith associates, (p, q) ∈ Ai, i...
AbstractWe prove the uniqueness of the two association schemes which appear in recent work of Henry ...
P(論文)"Let Ω = (X, {R_i}_) be commutative association scheme with class d. F_i, is a graph with respe...
We study (symmetric) three-class association schemes.The graphs with four distinct eigenvalues which...
AbstractIn this paper we construct a primitive, non-symmetric 3-class association scheme with parame...
AbstractIn this paper we construct a primitive, non-symmetric 3-class association scheme with parame...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
AbstractLet (X,G) be a primitive commutative association scheme. If g∈G is nonsymmetric of valency 4...
AbstractA primitive symmetric association scheme of class 2 is naturally embedded as a two-distance ...
The work of classification of association schemes began in [2] is continued. The assumption of $m_{1...
AbstractIn [5], Mathon described a pseudocyclic symmetric 3-class association scheme on 28 points. I...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
In this paper we enumerate essentially all non-symmetric association schemes with three classes, les...