Infinite Graphical Frobenius Representations

Electronic Journal Of Combinatorics

Mark E. Watkins¹ 

关键词: Frobenius group;    Cayley graph;    Automorphism group;    Ends;    Growth rate;    GRR;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A graphical Frobenius representation (GFR) of a Frobenius (permutation) group $G$ is a graph $\Gamma$ whose automorphism group Aut$(\Gamma)$ acts as a Frobenius permutation group on the vertex set of $\Gamma$, that is, Aut$(\Gamma)$ acts vertex-transitive

【 授权许可】

Others