Bulletin of the Australian Mathematical Society · 2009 · 14 citations · 7 references
Natural SciencesMathematicsAlgebraCombinatoricsNon-discriminationCombinatorial Set TheoryGroup TheoryNoncommutative AlgebraUniversal AlgebraMaximal SubgroupsPermutation Groups
Abstract Let G be a group. A subset N of G is a set of pairwise noncommuting elements if xy ⁄= yx for any two distinct elements x and y in N . If ∣ N ∣≥∣ M ∣ for any other set of pairwise noncommuting elements M in G , then N is said to be a maximal subset of pairwise noncommuting elements. In this paper we determine the cardinality of a maximal subset of pairwise noncommuting elements in a three-dimensional general linear group. Moreover, we show how to modify a given maximal subset of pairwise noncommuting elements into another maximal subset of pairwise noncommuting elements that contains a given ‘generating element’ from each maximal torus.
7
Non-commuting graph of a group
Aliréza Abdollahi, Saieed Akbari, Hamid Reza Maimani · Journal of Algebra · 2006 · 332 citations
A problem of Paul Erdös on groups
Journal of the Australian Mathematical Society · 1976 · 196 citations · Full text
Some applications of graph theory to finite groups
Edward A. Bertram · Discrete Mathematics · 1983 · 82 citations
On non-commuting sets in an extraspecial p-group
A. Y. M. Chin · Journal of Group Theory · 2005 · 29 citations