加载中…
The relative fixity of a digraph is defined as the ratio between the largest number of vertices fixed by a nontrivial automorphism of and the number of vertices of . We characterize the vertex-primitive digraphs whose relative fixity is at least , and we show that there are only finitely many vertex-primitive digraphs of bounded out-valency and relative fixity exceeding a positive constant.

生成讲解博客的中文版本

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