加载中…
Every Hadamard matrix of order induces a graph with vertices, called the Hadamard graph of . Since is a distance-regular graph with diameter , it induces a -class association scheme of order . In this article we deal with fission schemes of under certain conditions, and for such a fission scheme we estimate the number of isomorphism classes with the same intersection numbers as the fission scheme.

生成讲解博客的中文版本

生成AI智能校验的中文版本