pith. sign in

arxiv: 1806.02115 · v1 · pith:5TUDVQI6new · submitted 2018-06-06 · 🧮 math.GR

Group Partitions via Commutativity and Related Topics

classification 🧮 math.GR
keywords abeliancommutinggroupspartitionsomegraphsgroupldots
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.