Solvable groups whose prime divisor character degree graphs are 1-connected
The prime divisor character degree graph \(\Delta(G)\) of a finite group \(G\) is defined as follows: The vertices of \(\Delta(G)\) are the primes that divide \(\chi(1)\) for some \(\chi\in \operatorname{Irr}(G)\), and two distinct vertices \(p\) and \(q\) are connected by an edge when \(pq\) divides \(\chi(1)\) for some \(\chi\in \operatorname{Irr}(G)\). This graph has been studied in various papers in the situation where \(G\) is solvable. (For an overview up to 2008, see [\textit{M. Lewis}, Rocky Mt. J. Math. 39, No. 1, 175--211 (2008; Zbl 1166.20006)].) In the paper under review, cut vertices of \(\Delta(G)\) for \(G\) solvable are studied. A vertex of a graph is a cut vertex when removing it increases the number of connected components. The authors show that \(\Delta(G)\) can have at most one cut vertex. When \(\Delta(G)\) has a cut vertex, then \(G\) can have at most two normal nonabelian Sylow subgroups. The structure of such groups with exactly two normal nonabelian Sylow subgroups is investigated further.
- Solvable groups with irreducible character degree graphs having connected components.
- On the character degree graph of solvable groups
- Solvable groups character degrees and sets of primes
- Solvable groups having almost relatively prime distinct irreducible character degrees
- Solvable groups whose character degree graphs generalize squares
- Solvable groups whose degree graphs have two connected components
- On the character degree graph of solvable groups. I: Three primes
- On the character degree graph of solvable groups. II. Discon- nected graphs
- A characterization of the prime graphs of solvable groups.
- Classifying families of character degree graphs of solvable groups
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Bounding Fitting heights of character degree graphs
- Character degree graphs of solvable groups with diameter three
- Fitting Height and Diameter of Character Degree Graphs
- Graph theory
- Groups whose character degree graph has diameter three
- scientific article; zbMATH DE number 4110917 (Why is no real title available?)
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- On the character degree graph of solvable groups. I: Three primes
- On the Number of Components of a Graph Related to Character Degrees
- Solvable groups whose degree graphs have two connected components
- SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3
- On cut vertices and eigenvalues of character graphs of solvable groups
- Groups whose prime graph on class sizes has a cut vertex
- Solvable groups whose character degree graphs generalize squares
- 1-Connected character-graphs of finite groups with non-bipartite complement
- Non-solvable groups whose character degree graph has a cut-vertex. III
- Non-solvable groups whose character degree graph has a cut-vertex. I
- Non-solvable groups whose character degree graph has a cut-vertex. II
- Character theory and categorification. Abstracts from the workshop held August 28 -- September 3, 2022
- Eulerian character degree graphs of solvable groups
- On the metric dimension of the character degree graph of a solvable group
- Classifying character degree graphs with seven vertices
- Laplacian eigenvalues of character degree graphs of solvable groups
- On the structure of the character degree graphs having diameter three
This page was built for publication: Solvable groups whose prime divisor character degree graphs are 1-connected
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329136)
