4-Regular prime graphs of nonsolvable groups

2019/01/11 by Donnie Munyao Kasyoki, Kasyoki, Donnie Munyao, Paul Odhiambo Oleche +1
Computer Science · Engineering · Mathematics · #20C15 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Representation Theory (math.RT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1901.03492

openalex publication_date 2019/01/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be a finite group and cd(G) denote the character degree set for G. The prime graph Δ(G) is a simple graph whose vertex set consists of prime divisors of elements in cd(G), denoted ρ(G). Two primes p,q∈ ρ(G) are adjacent in Δ(G) if and only if pq|a for some a∈ cd(G). We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.

Related

• Finite groups whose prime graphs are regular
• Classifying prime graphs of finite groups -- a methodical approach
• A Characterization of the Prime Graphs of Solvable Groups
• On prime character degree graphs occurring within a family of graphs
• Classifying Families of Character Degree Graphs of Solvable Groups