论文标题
通勤图的组动作很少
Commuting graph of a group action with few edges
论文作者
论文摘要
让$ a $是该动作的$g。$ \ textit {$ a $g。 \{1\}$, where two distinct vertices $x^{A}$ and $y^{A}$ are joined by an edge if and only if there exist $x_{1}\in x^{A}$ and $y_{1}\in y^{A}$ such that $[x_{1},y_{1}]=1$.本文表征了$γ（g，a）$的组$ g $，是$ \ mathcal {f} $ - 图，也就是说，一个连接的图，最多包含一个dertex，其学位不少于三个。
Let $A$ be a group acting by automorphisms on the group $G.$ \textit{The commuting graph $Γ(G,A)$ of $A$-orbits} of this action is the simple graph with vertex set $\{x^{A} : 1\ne x \in G \}$, the set of all $A$-orbits on $G\setminus \{1\}$, where two distinct vertices $x^{A}$ and $y^{A}$ are joined by an edge if and only if there exist $x_{1}\in x^{A}$ and $y_{1}\in y^{A}$ such that $[x_{1},y_{1}]=1$. The present paper characterizes the groups $G$ for which $Γ(G,A)$ is an $\mathcal{F}$-graph, that is, a connected graph which contains at most one vertex whose degree is not less than three.
