Regular character degree graphs.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 67383 (Why is no real title available?)
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- scientific article; zbMATH DE number 1979718 (Why is no real title available?)
- scientific article; zbMATH DE number 2151357 (Why is no real title available?)
- A note on character degrees of finite solvable groups
- Bounding Fitting heights of character degree graphs
- Character degree graphs with no complete vertices.
- Degree problems II π - separable character degrees
- Finite Solvable Groups Whose Character Degree Graphs Are Not Complete
- Fitting Height and Diameter of Character Degree Graphs
- Fitting height and character degree graphs.
- Fitting heights and the character degree graph
- On the Number of Components of a Graph Related to Character Degrees
- On the character degree graph of solvable groups. I: Three primes
- On the character degree graph of solvable groups. II. Discon- nected graphs
- SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3
- Solvable groups whose degree graphs have two connected components
- Square character degree graphs yield direct products.
- The \(p\)-length of a solvable group bounded by conditions on its character degree graph
Cited in
(15)- On distinct character degrees.
- An answer to a question of Isaacs on character degree graphs.
- Character degree graphs that are complete graphs
- On the regularity of character degree graphs
- Eulerian character degree graphs of solvable groups
- Classifying character degree graphs with six vertices
- On cut vertices and eigenvalues of character graphs of solvable groups
- Fitting Height and Diameter of Character Degree Graphs
- Coloring of character graphs
- 4-regular prime graphs of nonsolvable groups
- Character degree graphs with no complete vertices.
- Finite groups whose common-divisor graph is regular
- 5-regular prime graphs of finite nonsolvable groups
- Finite groups with \(K_4\)-free prime graphs.
- Regular character-graphs whose eigenvalues are greater than or equal to \(-2\)
This page was built for publication: Regular character degree graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403348)