Commutative association schemes whose symmetrizations have two classes (Q1906252)

\((X, {\mathbf R})\) be an commutative \(d\)-scheme. The scheme \((X, \overline{{\mathbf R}})\) is called a symmetrization of \((X, {\mathbf R})\) if \(\overline{{\mathbf R}}= \{R\cup R^{- 1}\mid R\in {\mathbf R}\}\). The author investigates commutative \(d\)-schemes whose symmetrizations are 2-schemes. Theorem 2.4 gives a classification of association schemes whose symmetrizations are obtained from multipartite strongly regular graphs in the notions of character table and wreath product of two schemes. Also Paley graphs are considered.