加载中…
We study -arc-transitive graphs for innately transitive permutation groups such that can be embedded into a wreath product acting in product action on . We find two such connected graphs: the first is Sylvester’s double six graph with 36 vertices, while the second is a graph with vertices whose automorphism group is . We prove that under certain conditions no more such graphs exist.

生成讲解博客的中文版本

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