The Gruenberg-Kegel graph of finite solvable rational groups

2023/06/22 by Sara C. Debón, Debón, Sara C., Diego García-Lucas +3 · 1 citation
Mathematics · Materials Science · #Finite Group Theory Research #Synthesis and properties of polymers #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2306.12883

Abstract

A finite group G is said to be rational if every character of G is rational-valued. The Gruenberg-Kegel graph of a finite group G is the undirected graph whose vertices are the primes dividing the order of G and the edges join different primes p and q whenever G contains an element of order pq. In this paper, we complete the classification of the Gruenberg-Kegel graphs of finite solvable rational groups initiated in \citeBKMdR.

Cited by

• Cut Groups: The Progress And The Problems

Related

• Gruenberg-Kegel graphs: cut groups, rational groups and the Prime Graph Question
• Prime and N-Prime graphs of solvable uniformly semi-rational groups
• On combinatorial properties of Gruenberg--Kegel graphs of finite groups
• On characterization of groups by isomorphism type of Gruenberg-Kegel graph
• On the Gruenberg-Kegel Graph of Integral Group Rings of Finite Groups