Related papers: On $\sigma$-arithmetic graphs of finite groups

Let $G$ be a finite group. Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $n$ an integer. We write $\sigma (n) =\{\sigma_{i} |\sigma_{i}\cap \pi (n)\ne \emptyset \}$, $\sigma (G) =\sigma (|G|)$.…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$, $G$ a finite group and $\sigma (G) =\{\sigma_{i} |\sigma_{i}\cap \pi (G)\ne \emptyset \}$. A set ${\cal H}$ of subgroups of $G$ is said to be a…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$, $G$ a finite group and $\sigma (G) =\{\sigma_{i} |\sigma_{i}\cap \pi (G)\ne \emptyset \}$. A set ${\cal H}$ of subgroups of $G$ is said to be a…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. A set ${\cal H}$ of subgroups of $G$ is said to be a \emph{complete Hall $\sigma $-set} of $G$ if every member $\ne 1$ of ${\cal…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$. A set ${\cal H}$ of subgroups of $G$ is said to be a \emph{complete Hall $\sigma $-set} of $G$ if every member $\ne 1$ of ${\cal H}$ is a Hall…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. Let $\sigma (G)=\{\sigma _{i} : \sigma _{i}\cap \pi (G)\ne \emptyset$. A set ${\cal H}$ of subgroups of $G$ is said to be a…

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…

Let $\sigma =\{\sigma_i |i\in I\}$ is some partition of all primes $\mathbb{P}$ and $G$ a finite group. A subgroup $H$ of $G$ is said to be $\sigma$-subnormal in $G$ if there exists a subgroup chain $H=H_0\leq H_1\leq \cdots \leq H_n=G$…

The Hawkes graph $\Gamma_H(G)$ of $G$ is the directed graph whose vertex set coincides with $\pi(G)$ and it has the edge $(p, q)$ whenever $q\in\pi(G/O_{p',p}(G))$. The Sylow graph $\Gamma_s(G)$ of $G$ is the directed graph with vertex set…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. $G$ is said to be $\sigma$-soluble if every chief factor $H/K$ of $G$ is a $\sigma _{i}$-group for some $i=i(H/K)$. A set…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. $G$ is said to be \emph{$\sigma$-soluble} if every chief factor $H/K$ of $G$ is a $\sigma_{i}$-group for some $i=i(H/K)$. A…

Let $\sigma=\{\sigma_{i}|i\in I\}$ be some partition of the set $\mathbb{P}$ of all primes, that is, $\mathbb{P}=\bigcup_{i\in I}\sigma_{i}$ and $\sigma_{i}\cap \sigma_{j}=\emptyset$ for all $i\neq j$. Let $G$ be a finite group. A set…

A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors…

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…

Throughout this paper, all groups are finite. Let $\sigma =\{\sigma_{i} | i\in I \}$ be some partition of the set of all primes $\Bbb{P}$. If $n$ is an integer, the symbol $\sigma (n)$ denotes the set $\{\sigma_{i} |\sigma_{i}\cap \pi…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

The Gruenberg--Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is defined as follows. The vertex set of $\Gamma(G)$ is the set of all prime divisors of the order of $G$. Two distinct primes $r$ and $s$ regarded as…

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…