加载中…
The WL-rank of a digraph is defined to be the rank of the coherent configuration of . We construct a new infinite family of strictly Deza Cayley graphs for which the WL-rank is equal to the number of vertices. The graphs from this family are divisible design and integral.

生成讲解博客的中文版本

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