K4-free character graphs with seven vertices
From MaRDI portal
Publication:5220611
DOI10.1080/00927872.2019.1670197zbMath1476.20007arXiv1909.01180OpenAlexW2978835743MaRDI QIDQ5220611
Publication date: 27 March 2020
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.01180
Ordinary representations and characters (20C15) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (6)
n-Exact character graphs ⋮ Character graphs with diameter three ⋮ Disconnected character graphs and odd dominating sets ⋮ Planar character-graphs ⋮ 1-Connected character-graphs of finite groups with non-bipartite complement ⋮ Regular character-graphs whose eigenvalues are greater than or equal to \(-2\)
Cites Work
- Unnamed Item
- Unnamed Item
- Four-vertex degree graphs of nonsolvable groups.
- Groups whose prime graphs have no triangles.
- Square character degree graphs yield direct products.
- 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
- On the character degree graph of finite groups
- Finite groups with \(K_4\)-free prime graphs.
- Finite simple \(3'\)-groups are cyclic or Suzuki groups.
- On finite simple groups of order divisible by three primes only
- Normal \(p\)-complements and irreducible characters
- Solvable groups whose degree graphs have two connected components
- On the Number of Components of a Graph Related to Character Degrees
- Degree Graphs of Simple Linear and Unitary Groups
- Endliche Gruppen I
- Nonsolvable groups with no prime dividing three character degrees.
This page was built for publication: K4-free character graphs with seven vertices