加载中…
The WL-rank of a digraph is defined to be the rank of the coherent configuration of . The WL-dimension of is defined to be the smallest positive integer for which is identified by the -dimensional Weisfeiler-Leman algorithm. We classify the Deza circulant graphs of WL-rank . In additional, it is proved that each of these graphs has WL-dimension at most . Finally, we establish that some families of Deza circulant graphs have WL-rank or and WL-dimension at most .

生成讲解博客的中文版本

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