加载中…
In 2002, D. Fon-Der-Flaass constructed a prolific family of strongly regular graphs. In this paper, we prove that for infinitely many natural numbers , this family contains strongly regular -vertex graphs with the same parameters, which satisfy the following condition: an isomorphism between and any other graph can be verified by the -dimensional Weisfeiler-Leman algorithm.

生成讲解博客的中文版本

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