non-commuting graph
Let be a non-abelian group with center . Associate a graph with whose vertices are the non-central elements and whose edges join those vertices for which . Then is said to bethe non-commuting graph of .The non-commuting graph was first considered by PaulErdös, when he posed the following problem in 1975 [B.H. Neumann, A problem of Paul Erdös ongroups, J. Austral. Math. Soc. Ser. A 21 (1976), 467-472]:
Let be a group whose non-commuting graph has no infinite complete
subgraph
. Is it true that there is a finite bound on thecardinalities of complete subgraphs of ?
B. H. Neumann answered positively Erdös’ question.
The non-commuting graph of a non-abelian group is always connected with diameter 2 and girth 3.It is also Hamiltonian. is planar if and only if is isomphic to the symmetric group
, orthe dihedral group
of order or the quaternion group
of order .
See[Alireza Abdollahi, S. Akbari and H.R. Maimani, Non-commuting graph of a group, Journal of Algbera, 298 (2006) 468-492.] for proofs of these properties of .
Examples
Symmetric group
The symmetric group is the smallest non-abelian group. In cyclenotation, we have
The center is trivial: . The non-commuting graph inFigure 1 contains all possible edges except one.
Octic group
The dihedral group , generally known as the octic group, isthe symmetry group of the http://planetmath.org/node/1086square. If you label the vertices of thesquare from to going along the edges, the octic group may beseen as a http://planetmath.org/node/1045subgroup of the symmetric group :
So the octic group has http://planetmath.org/node/2871order (hence its name), and its centerconsists of the identity element and the simultaneous flip around bothdiagonals . Its non-commuting graph is given inFigure 2.