论文标题
在循环图的WL维度上
On the WL-dimension of circulant graphs of prime power order
论文作者
论文摘要
图X的WL维度是最小的正整数M，因此M维weisfeiler-Lean算法正确测试X与任何其他图之间的同构。事实证明，任何元电源循环图的WL维度最多为3，并且该界限无法减少。证明是基于使用循环组上的相干配置和开谷方案的理论。
The WL-dimension of a graph X is the smallest positive integer m such that the m-dimensional Weisfeiler-Leman algorithm correctly tests the isomorphism between X and any other graph. It is proved that the WL-dimension of any circulant graph of prime power order is at most 3, and this bound cannot be reduced. The proof is based on using theories of coherent configurations and Cayley schemes over a cyclic group.
