FINITE GROUPS WHOSE PRIME GRAPHS ARE REGULAR

Abstract. Let G be a finite group and let Irr(G) be the set of all irreducible complex characters of G. Let cd(G) be the set of all character degrees of G and denote by ρ(G) the set of primes which divide some character degrees of G. The prime graph ∆(G) associated to G is a graph whose vertex set is ρ(G) and there is an edge between two distinct primes p and q if and only if the product pq divides some character degree of G. In this paper, we show that the prime graph ∆(G) of a finite group G is 3-regular if and only if it is a complete graph with four vertices. 1