Related papers: On finite groups whose power graph is a cograph

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…

The power graph P(G) of a group G is a graph with vertex set G, where two vertices u and v are adjacent if and only if one is the power of the other. In this paper, we raise and study the following question: For which natural numbers n…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of…

The power graph $\mathcal{P}(G)$ of a group $G$ is the graph whose vertex set is $G$, having an edge between two distinct vertices if one is the power of the other. The directed power graph $\vec{\mathcal{P}}(G)$ of a group $G$ is the…

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…

The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are adjacent if and only if either $u=v^m$ or $v=u^n$ for…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

The power graph $\mathcal P_G$ of a finite group $G$ is the graph with the vertex set $G$, where two elements are adjacent if one is a power of the other. We first show that $\mathcal P_G$ has an transitive orientation, so it is a perfect…

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…

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…

The codegree of an irreducible character $\chi$ of a finite group $G$ is defined as $|G:\ker\chi|/\chi(1)$. The codegree graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertices are the prime divisors of $|G|$, where two distinct…

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 power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…

Let $G$ be a group. The power graph of $G$ is a graph with vertex set $G$ in which two distinct elements $x,y$ are adjacent if one of them is a power of the other. We characterize all groups whose power graphs have finite independence…

Given a group $G$, we define the power graph $\mathcal{P}(G)$ as follows: the vertices are the elements of $G$ and two vertices $x$ and $y$ are joined by an edge if $\langle x \rangle \subseteq \langle y \rangle$ or $\langle y \rangle…

The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…

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…

For a finite group $G$, the proper power graph $\mathscr{P}^*(G)$ of $G$ is the graph whose vertices are non-trivial elements of $G$ and two vertices $u$ and $v$ are adjacent if and only if $u \neq v$ and $u^m=v$ or $v^m=u$ for some…

Let $\mathcal{X}$ be a set of integers greater than one. The $\mathcal{X}$-excluded power graph of a group $G$ has vertex set $G$ and an edge from $g$ to each power of $g$ other than itself provided that the power is not divisible by any…

In this paper, we study different forbidden subgraph characterizations of the prime-order element graph $\Gamma(G)$ defined on a finite group $G$. Its set of vertices is the group $G$ and two vertices $x,y \in G$ are adjacent if the order…