$K_4$-free character graphs with diameter three
Group Theory
2020-06-30 v1 Combinatorics
Abstract
Let be a finite group and let be the set of all irreducible complex characters of . Let be the set of all character degrees of and denote by the set of primes which divide some character degrees in . The character graph associated to is a graph whose vertex set is and there is an edge between two distinct primes and if and only if the product divides some character degree of . Suppose the character graph is -free with diameter . In this paper, we show that , if and only if , where is the first Janko's sporadic simple group and is abelian.
Cite
@article{arxiv.2006.15249,
title = {$K_4$-free character graphs with diameter three},
author = {Mahdi Ebrahimi},
journal= {arXiv preprint arXiv:2006.15249},
year = {2020}
}