Solvable groups whose prime divisor character degree graphs are 1-connected
From MaRDI portal
Publication:2329136
DOI10.1007/S00605-019-01276-8zbMATH Open1475.20015OpenAlexW2918439524MaRDI QIDQ2329136FDOQ2329136
Authors: Mark L. Lewis, Qingyun Meng
Publication date: 17 October 2019
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-019-01276-8
Recommendations
- 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
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinary representations and characters (20C15)
Cites Work
- Graph theory
- Title not available (Why is that?)
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- On the Number of Components of a Graph Related to Character Degrees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solvable groups whose degree graphs have two connected components
- On the character degree graph of solvable groups. I: Three primes
- Fitting Height and Diameter of Character Degree Graphs
- Character degree graphs of solvable groups with diameter three
- SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3
- Groups whose character degree graph has diameter three
- Bounding Fitting heights of character degree graphs
Cited In (8)
- On cut vertices and eigenvalues of character graphs of solvable groups
- Non-solvable groups whose character degree graph has a cut-vertex. I
- Non-solvable groups whose character degree graph has a cut-vertex. II
- 1-Connected character-graphs of finite groups with non-bipartite complement
- Groups whose prime graph on class sizes has a cut vertex
- Eulerian character degree graphs of solvable groups
- Solvable groups whose character degree graphs generalize squares
- Character theory and categorification. Abstracts from the workshop held August 28 -- September 3, 2022
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)