Solvable conjugacy class graph of groups

From MaRDI portal
Publication:6041569



Abstract: In this paper we introduce the graph Gammasc(G) associated with a group G, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of G and two distinct conjugacy classes C,D are adjacent if there exist xinC and yinD such that langlex,yangle is solvable. We discuss the connectivity, girth, clique number, and several other properties of the SCC-graph. One of our results asserts that there are only finitely many finite groups whose SCC-graph has given clique number~d, and we find explicitly the list of such groups with d=2.


The authors introduce a graph \(\Gamma_{\mathrm{sc}}(\mathrm{G})\) associated with a group \(\mathrm{G}\), called the solvable conjugacy class graph (abbreviated as \(\mathrm{SCC}\)-graph), whose vertices are the nontrivial conjugacy classes of \(\mathrm{G}\). Two distinct conjugacy classes \(\mathrm{C, D}\) are adjacent if there exist \(x \in\mathrm{C}\) and \(y \in\mathrm{D}\) such that \(\langle x,y \rangle\) is solvable. The authors discuss the connectivity, girth, clique number, and several other properties of the \(\mathrm{SCC}\)-graph. They show that there are only finitely many finite groups whose \(\mathrm{SCC}\)-graph has given clique number \(\mathrm{d}\). They list such groups with \(\mathrm{d} = 2\).











This page was built for publication: Solvable conjugacy class graph of groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041569)