Group Partitions via Commutativity and Related Topics
Abstract
Let G be a nonabelian group, A⊂eq G an abelian subgroup and n≥slant 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 A1, A2, …, An of G, such that |Ai|>1 for each i=1, 2, …, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.