On the character degree graph of solvable groups
From MaRDI portal
Abstract: Let (G) be a finite solvable group, and let (Delta(G)) denote the emph{prime graph} built on the set of degrees of the irreducible complex characters of (G). A fundamental result by P.P. P'alfy asserts that the complement of the graph (Delta(G)) does not contain any cycle of length (3). In this paper we generalize P'alfy's result, showing that does not contain any cycle of odd length, whence it is a bipartite graph. As an immediate consequence, the set of vertices of (Delta(G)) can be covered by two subsets, each inducing a complete subgraph. The latter property yields in turn that if (n) is the clique number of (Delta(G)), then (Delta(G)) has at most (2n) vertices. This confirms a conjecture by Z. Akhlaghi and H.P. Tong-Viet, and provides some evidence for the famous emph{(
ho)-(sigma) conjecture} by B. Huppert.
Recommendations
- On prime character degree graphs occurring within a family of graphs
- A note on character degrees of finite solvable groups
- On the character degree graph of solvable groups. I: Three primes
- On the character degree graph of solvable groups. II. Discon- nected graphs
- A solvable group whose character degree graph has diameter 3
Cites work
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Character Degree Graphs of Solvable Groups of Fitting Height 2
- Character theory of finite groups.
- Endliche Gruppen I
- Finite groups with K₄-free prime graphs.
- Groups whose character degree graph has diameter three
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- On the character degree graph of solvable groups. I: Three primes
Cited in
(26)- On solvable groups and circulant graphs
- Groups whose degree graph has three independent vertices
- Regular character-graphs whose eigenvalues are greater than or equal to -2
- Solvable groups whose character degree graphs generalize squares
- Classifying character degree graphs with six vertices
- Bounding the number of vertices in the degree graph of a finite group
- Solvable groups whose prime divisor character degree graphs are 1-connected
- On the character degree graph of finite groups
- The prime graph on class sizes of a finite group has a bipartite complement
- scientific article; zbMATH DE number 6387633 (Why is no real title available?)
- Coloring of character graphs
- A new characterization of some simple groups by order and degree pattern of solvable graph
- On the character degree graph of solvable groups. II. Discon- nected graphs
- 1-Connected character-graphs of finite groups with non-bipartite complement
- THE CHARACTER GRAPH OF A FINITE GROUP IS PERFECT
- \(n\)-exact character graphs
- Character graphs with diameter three
- Disconnected character graphs and odd dominating sets
- Planar character-graphs
- Finite groups with \(K_5\)-free prime graphs
- On the absence of a normal nonabelian Sylow subgroup
- A note on character degrees of solvable groups
- On prime character degree graphs occurring within a family of graphs
- Classifying character degree graphs with seven vertices
- A family of graphs that cannot occur as character degree graphs of solvable groups
- Finite solvable groups whose character graphs are trees.
This page was built for publication: On the character degree graph of solvable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132784)