Related papers: Finite groups whose prime graphs are regular

Let ${\rm GK}(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

The Gruenberg-Kegel graph (or the 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…

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

A graph G = (V,E) is called fully regular if for every independent set $I\subset V$ , the number of vertices in $V\setminus$ I that are not connected to any element of I depends only on the size of I. A linear ordering of the vertices of G…

The power graph of a group $G$ is a simple and undirected graph with vertex set $G$ and two distinct vertices are adjacent if one is a power of the other. In this article, we characterize (non-cyclic) finite groups of prime exponent and…

T.C. Burness and S.D. Scott \cite{3} classified finite groups $G$ such that the number of prime order subgroups of $G$ is greater than $|G|/2-1$. In this note, we study finite groups $G$ whose subgroup graph contains a vertex of degree…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…

The prime graph, or Gruenberg--Kegel graph, of a finite group $G$ is the graph $\Gamma(G)$ whose vertices are the prime divisors of $|G|$, and whose edges are the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A finite…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

For a finite group $G$ the co-prime graph $\Gamma(G)$ is defined as a graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $gcd(o(x),o(y))=1$ where $o(x)$ and $o(y)$ denote the orders of the…

Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…

Let $G$ be a finite group. For some fixed prime $p$, let $\Gamma_p(G)$ be the common divisor graph built on the set of sizes of $p$-regular conjugacy classes of $G$: this is the simple undirected graph whose vertices are the class sizes of…

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…

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…