AbstractFor a given non-symmetric commutative association scheme, by fusing all the non-symmetric relations pairwise with their symmetric counterparts, we can obtain a new symmetric association scheme. In this paper, we introduce a set of feasibility and realizability conditions for a class e symmetric association scheme to be split into a class e+1 non-symmetric commutative association scheme. By applying the feasibility and realizability conditions, we obtain a classification into six categories of the class 4 non-symmetric fission schemes of group-divisible 3-schemes. Complete solutions for three of the six categories and partial results for the remaining cases are presented
AbstractAn association scheme is called skew-symmetric if it has no symmetric adjacency relations ot...
AbstractAs a continuation of my paper [T. Fujisaki, A construction of amorphous association scheme f...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...
AbstractFor a given non-symmetric commutative association scheme, by fusing all the non-symmetric re...
AbstractFor a given commutative association scheme L, by fusing all the non-self-paired relations pa...
AbstractFor a given commutative association scheme L, by fusing all the non-self-paired relations pa...
AbstractIn this paper a set of necessary conditions for the existence of a non-symmetric 3-class ass...
AbstractIn this paper we present a classification into three categories of the imprimitive non-symme...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
AbstractAn association scheme is amorphous if it has as many fusion schemes as possible. At the alge...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
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...
AbstractIn this paper we enumerate essentially all non-symmetric association schemes with three clas...
AbstractLet (X, {Ri}0⩽i⩽d) be a primitive commutative association scheme. If there is a non-symmetri...
AbstractAn association scheme is called skew-symmetric if it has no symmetric adjacency relations ot...
AbstractAs a continuation of my paper [T. Fujisaki, A construction of amorphous association scheme f...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...
AbstractFor a given non-symmetric commutative association scheme, by fusing all the non-symmetric re...
AbstractFor a given commutative association scheme L, by fusing all the non-self-paired relations pa...
AbstractFor a given commutative association scheme L, by fusing all the non-self-paired relations pa...
AbstractIn this paper a set of necessary conditions for the existence of a non-symmetric 3-class ass...
AbstractIn this paper we present a classification into three categories of the imprimitive non-symme...
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classe...
AbstractAn association scheme is amorphous if it has as many fusion schemes as possible. At the alge...
Summary. There are 24 feasible parameter sets for a primitive non-symmetric association schemes with...
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...
AbstractIn this paper we enumerate essentially all non-symmetric association schemes with three clas...
AbstractLet (X, {Ri}0⩽i⩽d) be a primitive commutative association scheme. If there is a non-symmetri...
AbstractAn association scheme is called skew-symmetric if it has no symmetric adjacency relations ot...
AbstractAs a continuation of my paper [T. Fujisaki, A construction of amorphous association scheme f...
AbstractThe Clebsch graph can, as any strongly regular graph, be considered as one of the graphs of ...