4-Regular prime graphs of nonsolvable groups
arXiv:1901.03492
Abstract
Let be a finite group and denote the character degree set for . The prime graph is a simple graph whose vertex set consists of prime divisors of elements in , denoted . Two primes are adjacent in if and only if for some . We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.
36 pages,