K4K_4-free character graphs with diameter three

preprint2020arXivOpen access

Abstract

Let GG be a finite group and let Irr(G)\rm{Irr}(G) be the set of all irreducible complex characters of GG. Let cd(G)\rm{cd}(G) be the set of all character degrees of GG and denote by ρ(G)ρ(G) the set of primes which divide some character degrees in cd(G)\rm{cd}(G). The character graph Δ(G)Δ(G) associated to GG is a graph whose vertex set is ρ(G)ρ(G) and there is an edge between two distinct primes pp and qq if and only if the product pqpq divides some character degree of GG. Suppose the character graph Δ(G)Δ(G) is K4K_4-free with diameter 33. In this paper, we show that ∣ρ(G)∣≠5|ρ(G)|\neq 5, if and only if G≅J1×AG\cong J_1 \times A, where J1J_1 is the first Janko's sporadic simple group and AA is abelian.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.