Abstract

In this paper we study prime graphs of finite groups. The prime graph of a finite group GG, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing ∣G∣|G|} and an edge pp-qq if and only if there exists an element of order pqpq in GG. In finite group theory, studying the prime graph of a group has been an important topic for the past almost half century. Only recently prime graphs of solvable groups have been characterized in graph theoretical terms only. In this paper, we continue this line of research and give complete characterizations of several classes of groups, including groups of square-free order, metanilpotent groups, groups of cube-free order, and, for any n∈Nn\in \mathbb{N}, solvable groups of nthn^\text{th}-power-free order. We also explore the prime graphs of groups whose composition factors are cyclic or A5A_5 and draw connections to a conjecture of Maslova. We then propose an algorithm that recovers the prime graph from a dual prime graph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.