K4-free character graphs with diameter three
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 in cd(G). The character 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. Suppose the character graph (G) is K4-free with diameter 3. In this paper, we show that |(G)|≠ 5, if and only if G J1 × A, where J1 is the first Janko's sporadic simple group and A is abelian.
0