Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups#
Let \(G\) be finite group and let \(N\) be a normal subgroup of \(G\). Let \(\text{cd}(G|N)\) be the set of the degrees of the irreducible characters of \(G\) whose kernels do not contain \(N\). A graph is associated with this set. The vertices of this graph are the primes dividing degrees in \(\text{cd}(G|N)\), and there is an edge between \(p\) and \(q\) if \(pq\) divides some degree in \(\text{cd}(G|N)\). In this paper, this graph is studied when it is disconnected, and its diameter when it is connected. The paper contains a lot of interesting results, among them centering around so-called ``groups of disconnected type, view \textit{M. L. Lewis} [J. Group Theory 4, No. 3, 255-275 (2001; Zbl 0998.20009)]. From the paper under review, we now quote some of the main results. Theorem A. Let \(N\triangleleft G\). Then \(\Delta(G/N)\) has at most three connected components. If \(G<G'\), then \(\Delta(G/N)\) has at most two connected components. Theorem B. Given a group \(G\), there exists \(N\triangleleft G\) with \(\Delta(G/N)\) disconnected if and only if either 1. \(\Delta(G)\) is disconnected, or 2. \(G\) is of disconnected type. Corollary C. Suppose \(G\) is solvable, with \(N\triangleleft G\) so that \(\Delta(G/N)\) is disconnected. Then \(G\) has Fitting height at most 4, \(\Delta(G/N)\) has at most two connected components, and each connected component is a complete graph. Theorem B has many consequences which are also shown in this paper. Lack of space prohibits the reviewer to state more results of this very interesting paper. To close with, we furnish the definition of \(\Delta(X)\) for a finite group \(X\), used above. Namely, let \(\text{cd}(X)=\{\chi(1)\mid\chi\in\text{Irr}(X)\}\), let \(\rho(\text{cd}(X))\) be the set of primes dividing some element of \(\text{cd}(X)\); define the graph \(\Delta(\text{cd}(X))\) with \(\rho(\text{cd}(X))\) as vertices, saying that there is an edge between the primes \(p\) and \(q\) if \(pq\) divides some element of \(\text{cd}(X)\). Now put shortly \(\Delta(X)=\Delta(\text{cd}(X))\).
- Bounding Fitting heights of character degree graphs
- Bounding graph diameters of nonsolvable groups.
- Bounding graph diameters of solvable groups.
- Character degree graphs and normal subgroups
- Connectedness of degree graphs of nonsolvable groups.
- Coprime Group Actions Fixing All Nonlinear Irreducible Characters
- Diameters of degree graphs of nonsolvable groups.
- Finite groups. I.
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- Irreducible character degrees and normal subgroups
- Solvable groups whose degree graphs have two connected components
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Connectedness of degree graphs of nonsolvable groups.
- Irreducible disconnected systems in groups
- Disconnectedness of the subgraph \(F^3\) for the group \({\varGamma}^3\)
- Strongly connective degree sets. II: Perfect derived subgroups.
- scientific article; zbMATH DE number 4021422 (Why is no real title available?)
- Taketa's theorem for relative character degrees.
- Character degree graphs and normal subgroups
- Nonsolvable groups satisfying the prime-power hypothesis.
- Disconnected character graphs and odd dominating sets
This page was built for publication: Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups#
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5707918)
