Solvable groups whose prime divisor character degree graphs are 1-connected

DOI10.1007/S00605-019-01276-8zbMath1475.20015OpenAlexW2918439524MaRDI QIDQ2329136

Qingyun Meng, Mark L. Lewis

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

zbMATH Keywords

finite solvable groupscut vertexcharacter degree graphcharacters of finite groups

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (8)

Non-solvable groups whose character degree graph has a cut-vertex. I ⋮ Non-solvable groups whose character degree graph has a cut-vertex. II ⋮ Character theory and categorification. Abstracts from the workshop held August 28 -- September 3, 2022 ⋮ On cut vertices and eigenvalues of character graphs of solvable groups ⋮ Eulerian character degree graphs of solvable groups ⋮ Solvable groups whose character degree graphs generalize squares ⋮ Groups whose prime graph on class sizes has a cut vertex ⋮ 1-Connected character-graphs of finite groups with non-bipartite complement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Character degree graphs of solvable groups with diameter three
• Groups whose character degree graph has diameter three
• An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
• On the character degree graph of solvable groups. I: Three primes
• Solvable groups whose degree graphs have two connected components
• Fitting Height and Diameter of Character Degree Graphs
• On the Number of Components of a Graph Related to Character Degrees
• SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3
• Bounding Fitting heights of character degree graphs

This page was built for publication: Solvable groups whose prime divisor character degree graphs are 1-connected