Groups whose degree graph has three independent vertices

DOI10.1016/j.jalgebra.2018.07.004zbMath1436.20006OpenAlexW2884002346WikidataQ129558258 ScholiaQ129558258MaRDI QIDQ1655796

Silvio Dolfi, Khatoon Khedri, Emanuele Pacifici

Publication date: 10 August 2018

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2434/585146

zbMATH Keywords

independent settriangle-free graphcharacter degree graph

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Group actions on combinatorial structures (05E18)

Related Items (3)

Non-solvable groups whose character degree graph has a cut-vertex. III ⋮ Non-solvable groups whose character degree graph has a cut-vertex. I ⋮ On the character degree graph of finite groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Groups whose character degree graph has diameter three
• On the character degree graph of solvable groups. I: Three primes
• Connectedness of degree graphs of nonsolvable groups.
• Diameters of degree graphs of nonsolvable groups.
• Diameters of degree graphs of nonsolvable groups. II.
• Products of primes in conjugacy class sizes and irreducible character degrees.
• Character degrees of extensions of PSL2(q) and SL2(q)
• On the character degree graph of solvable groups
• Prime divisors of character degrees
• Some linear actions of finite groups with q′-orbits
• The groups with exactly one class of size a multiple of p
• Character degree graphs of automorphism groups of characteristically simple groups
• A note on character degrees of finite solvable groups
• Large orbits in coprime actions of solvable groups

This page was built for publication: Groups whose degree graph has three independent vertices