Related papers: Solvable Groups in which Every Real Element has Pr…

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

We consider a finite group $G$ with a normal subgroup $N$ so that all elements of $G \setminus N$ have prime power order. We prove that if there is a prime $p$ so that all the elements in $G \setminus N$ have $p$-power order, then either…

In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…

The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…

In this paper we study the finite groups in which every element has prime power order, briefly them EPPO-groups. The classification of EPPO-groups is given including the cases of solvable, non-solvable and simple EPPO-groups. This paper is…

A $P_4$-free graph is called a cograph. In this paper we partially characterize finite groups whose power graph is a cograph. As we will see, this problem is a generalization of the determination of groups in which every element has prime…

Let \pi(G) denote the set of prime divisors of the order of a finite group G. The prime graph of G is the graph with vertex set \pi(G) with edges {p,q} if and only if there exists an element of order pq in G. In this paper, we prove that a…

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

In this sequel paper, we continue the analysis of the prime order element graph $\Gamma(G)$ of a finite group $G$, where vertices are elements of $G$ and edges connect distinct elements $x, y$ satisfying $\circ(xy) = p$ for some prime $p$.…

We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge…

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $\Gamma_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v…

The prime graph of a finite group $G$ is denoted by $\ga(G)$. Also $G$ is called recognizable by prime graph if and only if each finite group $H$ with $\ga(H)=\ga(G)$, is isomorphic to $G$. In this paper, we classify all finite groups with…

The prime graph (or Gruenberg-Kegel graph) of a finite group $G$ is a familiar graph. In this paper first, we investigate the structure of the finite groups with a non-complete prime graph. Then we prove that every alternating group…

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

The power graph $\mathcal{P}(G)$ is a graph with group elements as vertex set and two elements are adjacent if one is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph $\mathcal{P}(G)$ is a graph with vertex set…

An element $x$ in a finite group $G$ is said to be \textit{vanishing} if some (complex) irreducible character of $G$ takes value $0$ at $x$. In this article, we prove that every non-abelian finite simple group, except $\mathrm{SL}_2(4)$ and…

We say that finite groups are isospectral if they have the same sets of orders of elements. It is known that every nonsolvable finite group $G$ isospectral to a finite simple group has a unique nonabelian composition factor, that is, the…

Let $G$ be a group. The prime index graph of $G$, denoted by $\Pi(G)$, is the graph whose vertex set is the set of all subgroups of $G$ and two distinct comparable vertices $H$ and $K$ are adjacent if and only if the index of $H$ in $K$ or…

The power graph $\Gamma_G$ of a finite group $G$ is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. In this paper, we classify the finite groups whose power graphs have…