Bounding graph diameters of nonsolvable groups.
For a finite group \(G\) the set of degrees of all the irreducible characters of \(G\) is denoted by \(\text{cd}(G)\). The common-divisor graph \(\Gamma(G)\) associated with \(G\) is a graph with vertices \(\chi(1)\in\text{cd}(G)\) different from 1 and two vertices \(a\) and \(b\) are adjacent if they have a non-trivial common divisor. The author proved [in J. Algebra 280, No. 2, 415-425 (2004; Zbl 1077.20010)] that if \(G\) is a solvable group, then the diameter of \(\Gamma(G)\) is at most \(3\). In the paper under review the author proves the same result for a non-solvable group, extending the same result for every finite group.
- A characterization of groups in terms of the degrees of their characters. II
- A solvable group whose character degree graph has diameter 3
- Bounding graph diameters of solvable groups.
- Connectedness of degree graphs of nonsolvable groups.
- Diameters of degree graphs of nonsolvable groups.
- Endliche Gruppen I
- Groups having three complex irreducible character degrees
- scientific article; zbMATH DE number 3904833 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 4110917 (Why is no real title available?)
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- scientific article; zbMATH DE number 682077 (Why is no real title available?)
- scientific article; zbMATH DE number 3360363 (Why is no real title available?)
- On blocks of twisted group algebras
- On the Number of Components of a Graph Related to Character Degrees
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Bounding graph diameters of solvable groups.
- A bound on the diameter of the Brauer graph of a block of a solvable group
- Simple groups and strong covers.
- Strongly connective degree sets. I: Nonabelian solvable quotients.
- Nonsolvable groups satisfying the one-prime hypothesis.
- Character degree graphs that are complete graphs
- On Class Size of p-Singular Elements in Finite Groups
- 4-regular prime graphs of nonsolvable groups
- Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups#
- Five-vertex common divisor character degree graphs of non-solvable groups
- 5-regular prime graphs of finite nonsolvable groups
This page was built for publication: Bounding graph diameters of nonsolvable groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888813)