Let $G$ be a finite group and $\cd(G)$ denote the character degree set for $G$. The prime graph $\DG$ is a simple graph whose vertex set consists of prime divisors of elements in $\cd(G)$, denoted $\rho(G)$. Two primes $p,q\in \rho(G)$ are adjacent in $\DG$ if and only if $pq|a$ for some $a\in \cd(G)$. We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.
Kasyoki, D., Oleche, P. (2020). $4$-Regular prime graphs of nonsolvable groups. International Journal of Group Theory, 9(3), 193-222. doi: 10.22108/ijgt.2019.112277.1490
MLA
Donnie Kasyoki; Paul Oleche. "$4$-Regular prime graphs of nonsolvable groups". International Journal of Group Theory, 9, 3, 2020, 193-222. doi: 10.22108/ijgt.2019.112277.1490
HARVARD
Kasyoki, D., Oleche, P. (2020). '$4$-Regular prime graphs of nonsolvable groups', International Journal of Group Theory, 9(3), pp. 193-222. doi: 10.22108/ijgt.2019.112277.1490
VANCOUVER
Kasyoki, D., Oleche, P. $4$-Regular prime graphs of nonsolvable groups. International Journal of Group Theory, 2020; 9(3): 193-222. doi: 10.22108/ijgt.2019.112277.1490
)