Finite solvable groups whose character graphs are trees.
From MaRDI portal
Recommendations
- Finite Solvable Groups Whose Character Degree Graphs Are Not Complete
- Solvable graphs of finite groups
- Solvable groups with irreducible character degree graphs having connected components.
- On the character degree graph of solvable groups
- A characterization of the finite soluble groups
- The generating graph of finite soluble groups.
- A characterization of finite soluble groups
- A characterization of finite soluble groups
- On the Soluble Graph of a Finite Simple Group
- Finite nonsolvable groups whose character graphs have no triangles.
Cites work
- scientific article; zbMATH DE number 4110917 (Why is no real title available?)
- scientific article; zbMATH DE number 3762273 (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?)
- A note on character degrees of finite solvable groups
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Derived lengths and character degrees
- Finite Groups Having Only One Irreducible Representation of Degree Greater than One
- Finite Groups in which the Degrees of the Nonlinear Irreducible Characters are Distinct
- Finite groups whose conjugacy class graphs have few vertices.
- Finite groups with graphs containing no triangles
- On a Graph Related to Conjugacy Classes of Groups
- On the Diameter of a Graph Related to Conjugacy Classes of Groups
- On the Number of Components of a Graph Related to Character Degrees
- On the diameter of a graph related to \(p\)-regular conjugacy classes of finite groups
Cited in
(11)- Groups which do not have four irreducible characters of degrees divisible by a prime \(p\)
- Solvable graphs of finite groups
- Relative character graph using group representation
- Finite groups whose character degree graphs are empty graphs.
- \(n\)-exact character graphs
- Nonsolvable groups with no prime dividing three character degrees.
- Coloring of character graphs
- Finite groups with graphs containing no triangles
- Finite groups whose character graphs associated with codegrees have no triangles.
- FINITE SOLVABLE GROUPS WITH DISTINCT MONOMIAL CHARACTER DEGREES
- Finite nonsolvable groups whose character graphs have no triangles.
This page was built for publication: Finite solvable groups whose character graphs are trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876391)