Abstract
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,qin rho(G)$ are adjacent in $DG$ if and only if $pq|a$ for some $ain cd(G)$. We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
