Classifying families of character degree graphs of solvable groups
From MaRDI portal
Publication:5124338
Abstract: We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine completely which graphs occur as the prime character degree graph of a solvable group.
Recommendations
Cites work
- scientific article; zbMATH DE number 2151357 (Why is no real title available?)
- scientific article; zbMATH DE number 862502 (Why is no real title available?)
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Endliche Gruppen I
- On the character degree graph of solvable groups. I: Three primes
- SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3
- Solvable groups whose degree graphs have two connected components
Cited in
(8)- On prime character degree graphs occurring within a family of graphs
- Solvable groups whose prime divisor character degree graphs are 1-connected
- On prime character degree graphs occurring within a family of graphs. II
- Block pentagons cannot occur as character degree graphs of finite solvable groups
- A new characterization of some simple groups by order and degree pattern of solvable graph
- Coloring of character graphs
- Regular character-graphs whose eigenvalues are greater than or equal to \(-2\)
- Classifying character degree graphs with six vertices
This page was built for publication: Classifying families of character degree graphs of solvable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124338)