Solvable groups whose degree graphs have two connected components
The degree graph \(\Delta(G)\) of a finite group \(G\) has vertex set that consists of primes \(p\) with \(p\mid\chi(1)\) for some \(\chi\in\text{Irr}_\mathbb{C}(G)\), and there is an edge between \(p\) and \(q\) if \(pq\mid\chi(1)\) for some \(\chi\in\text{Irr}_\mathbb{C}(G)\). By a result of Manz, Willems and Wolf the degree graph \(\Delta(G)\) has at most three connected components for \(G\) arbitrary and at most two in case \(G\) is solvable.NEWLINENEWLINENEWLINEIn this interesting paper the author completely classifies solvable groups \(G\) for which \(\Delta(G)\) has two connected components.NEWLINENEWLINENEWLINEThe groups which occur fall into six families. They are mainly related to \(\text{SL}(2,3)\); \(\text{GL}(2,3)\); \(C_3\times C_3\) acted on by \(\text{SL}(2,3)\) or \(\text{GL}(2,3)\); finite fields acted on by a semi-linear affine group as \(S_4\) for example, and a further class involving Frobenius groups. For a detailed description we must refer to the original paper. Based on the classification list applications are given (for instance concerning the Fitting height and the derived length). The author mentions an earlier interesting result of Pálfy which states that in case \(\Delta(G)\) has two connected components and \(G\) is solvable the larger component has at least \(2^a-1\) vertices if the smaller one has \(a\) vertices.
- A note on character degrees of finite solvable groups
- On prime character degree graphs occurring within a family of graphs
- On the character degree graph of solvable groups. II. Discon- nected graphs
- Character degree graphs with no complete vertices.
- A graph associated with \(|\text{cd}(G)|-1\) degrees of a solvable group.
- Character theory of finite groups
- Endliche Gruppen I
- Fitting heights and the character degree graph
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- scientific article; zbMATH DE number 638171 (Why is no real title available?)
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Connectedness of degree graphs of nonsolvable groups.
- Bounding graph diameters of solvable groups.
- On cut vertices and eigenvalues of character graphs of solvable groups
- Regular character-graphs whose eigenvalues are greater than or equal to -2
- Rational groups whose character degree graphs are disconnected
- Five-vertex degree graphs of nonsolvable groups
- An overview on the bipartite divisor graph for the set of irreducible character degrees
- Solvable groups whose character degree graphs generalize squares
- Extending Huppert's conjecture to almost simple groups of Lie type
- Classifying character degree graphs with six vertices
- Solvable groups whose prime divisor character degree graphs are 1-connected
- Finite groups with K₄-free prime graphs.
- An answer to a question of Isaacs on character degree graphs.
- Co-degrees of irreducible characters in finite groups.
- Degree graphs of simple orthogonal and symplectic groups.
- The number of irreducible character degrees of solvable groups satisfying the one-prime hypothesis.
- Fitting Height and Diameter of Character Degree Graphs
- Finite groups whose character degree graphs are empty graphs.
- Finite groups with a given set of character degrees.
- A direct product coming from a particular set of character degrees.
- A graph associated with \(|\text{cd}(G)|-1\) degrees of a solvable group.
- Finite Groups with a Disconnectedp-Regular Conjugacy Class Graph
- Degree Graphs of Simple Groups of Exceptional Lie Type
- Character degree graphs of solvable groups with diameter three
- Groups with four character degrees and derived length four.
- Common divisor character degree graphs of solvable groups with four vertices.
- Taketa's theorem for relative character degrees.
- Regular character degree graphs.
- Square character degree graphs yield direct products.
- Bounding the derived length for a given set of character degrees.
- Character degree graphs with no complete vertices.
- Character degree graphs and normal subgroups
- Finite groups with two composite character degrees
- SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3
- On the character degree graph of solvable groups. II. Discon- nected graphs
- scientific article; zbMATH DE number 7080997 (Why is no real title available?)
- 1-Connected character-graphs of finite groups with non-bipartite complement
- Groups whose character degree graph has diameter three
- \(n\)-exact character graphs
- On prime character degree graphs occurring within a family of graphs. II
- On bipartite divisor graph for character degrees
- Bipartite divisor graph for the set of irreducible character degrees
- Classifying families of character degree graphs of solvable groups
- Disconnected character graphs and odd dominating sets
- On regular bipartite divisor graph for the set of irreducible character degrees
- Planar character-graphs
- K₄-free character graphs with seven vertices
- Groups whose bipartite divisor graph for character degrees has four or fewer vertices
- Finite groups whose common-divisor graph is regular
- Bounding the number of irreducible character degrees of a finite group in terms of the largest degree.
- Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups#
- On the absence of a normal nonabelian Sylow subgroup
- On prime character degree graphs occurring within a family of graphs
- Groups whose bipartite divisor graph for character degrees has five vertices
- Non-solvable groups whose character degree graph has a cut-vertex. I
- 5-regular prime graphs of finite nonsolvable groups
- Character theory and categorification. Abstracts from the workshop held August 28 -- September 3, 2022
- Common zeros of irreducible characters
- Classifying character degree graphs with seven vertices
- A family of graphs that cannot occur as character degree graphs of solvable groups
- A new characterization of non-abelian simple groups by their degree-patterns and orders.
- Determining group structure from the sets of character degrees.
This page was built for publication: Solvable groups whose degree graphs have two connected components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747313)
