scholarly journals On the character degree graph of solvable groups

2017 ◽  
Vol 146 (4) ◽  
pp. 1505-1513 ◽  
Author(s):  
Zeinab Akhlaghi ◽  
Carlo Casolo ◽  
Silvio Dolfi ◽  
Khatoon Khedri ◽  
Emanuele Pacifici

2001 ◽  
Vol 38 (1-4) ◽  
pp. 339-355 ◽  
Author(s):  
P. P. Pálfy

Let G be a finite solvable group and ¡ a set of primes such that the degree of each irreducible character of G is either a ¡-number or a ¡0-number. We show that such groups have a very restricted structure, for example, their nilpotent length is at most 4. We also prove that Huppert's ^{ÿ Conjecture is valid for these groups.



2020 ◽  
Vol 23 (2) ◽  
pp. 217-234
Author(s):  
Mark L. Lewis ◽  
Qingyun Meng

AbstractLet G be a solvable group, and let {\Delta(G)} be the character degree graph of G. In this paper, we generalize the definition of a square graph to graphs that are block squares. We show that if G is a solvable group so that {\Delta(G)} is a block square, then G has at most two normal nonabelian Sylow subgroups. Furthermore, we show that when G is a solvable group that has two normal nonabelian Sylow subgroups and {\Delta(G)} is block square, then G is a direct product of subgroups having disconnected character degree graphs.



2014 ◽  
Vol 21 (02) ◽  
pp. 355-360
Author(s):  
Xianxiu Zhang ◽  
Guangxiang Zhang

In this article, we prove that a finite solvable group with character degree graph containing at least four vertices has Fitting height at most 4 if each derived subgraph of four vertices has total degree not more than 8. We also prove that if the vertex set ρ(G) of the character degree graph Δ(G) of a solvable group G is a disjoint union ρ(G) = π1 ∪ π2, where |πi| ≥ 2 and pi, qi∈ πi for i = 1,2, and no vertex in π1 is adjacent in Δ(G) to any vertex in π2 except for p1p2 and q1q2, then the Fitting height of G is at most 4.





2013 ◽  
Vol 13 (02) ◽  
pp. 1350096 ◽  
Author(s):  
MARK L. LEWIS ◽  
ALEXANDER MORETÓ

We conjecture that the number of irreducible character degrees of a finite group is bounded in terms of the number of prime factors (counting multiplicities) of the largest character degree. We prove that this conjecture holds when the largest character degree is prime and when the character degree graph is disconnected.



2019 ◽  
Vol 198 (5) ◽  
pp. 1595-1614 ◽  
Author(s):  
Zeinab Akhlaghi ◽  
Carlo Casolo ◽  
Silvio Dolfi ◽  
Emanuele Pacifici ◽  
Lucia Sanus


2014 ◽  
Vol 178 (2) ◽  
pp. 251-257 ◽  
Author(s):  
Behrooz Khosravi ◽  
Behnam Khosravi ◽  
Bahman Khosravi ◽  
Zahra Momen


2000 ◽  
Vol 75 (5) ◽  
pp. 338-341 ◽  
Author(s):  
M.L. Lewis


2014 ◽  
Vol 15 (2) ◽  
pp. 537 ◽  
Author(s):  
Behrooz Khosravi ◽  
Bahman Khosravi ◽  
Behnam Khosravi ◽  
Zahra Momen


2018 ◽  
Vol 68 (4) ◽  
pp. 1149-1157
Author(s):  
Maryam Khademi ◽  
Behrooz Khosravi


Sign in / Sign up

Export Citation Format

Share Document