基于交换性的群划分及相关问题
Group Partitions via Commutativity and Related Topics
摘要：
设$G$为非阿贝尔群，$A\subseteq G$为阿贝尔子群，$n\geqslant 2$为整数。我们说$G$具有关于$A$的$n$ -阿贝尔划分，如果存在$G$的$A$和$n$不相交的交换子集$A_1, A_2, \ldots, A_n$的划分，使得对于每个$i=1, 2, \ldots, n$都有$|A_i|>1$.我们首先分类所有nonabel群，同构，其中有一个$n$ -阿贝尔分区$n=2, 3$。然后，我们给出了与某些有限群相关的交换图的生成树个数的计算公式。最后给出了求某些特定群的交换图的生成树个数的方法。
英文摘要：
Let $G$ be a nonabelian group, $A\subseteq G$ an abelian subgroup and $n\geqslant 2$ an integer. We say that $G$ has an $n$-abelian partition with respect to $A$, if there exists a partition of $G$ into $A$ and $n$ disjoint commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|>1$ for each $i=1, 2, \ldots, n$. We first classify all nonabelian groups, up to isomorphism, which have an $n$-abelian partition for $n=2, 3$. Then, we provide some formulas concerning the number of spanning trees of commuting graphs associated with certain finite groups. Finally, we point out some ways to finding the number of spanning trees of the commuting graphs of some specific groups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
