Related papers: Power graphs of (non)orientable genus two

The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

The power graph of a group $G$, denoted as $P(G)$, constitutes a simple undirected graph characterized by its vertex set $G$. Specifically, vertices $a,b$ exhibit adjacency exclusively if $a$ belongs to the cyclic subgroup generated by $b$…

For a finite group $G$ denote by $\gamma(L(G))$ the genus of the subgroup graph of $G.$ We prove that $\gamma(L(G))$ tends to infinity as either the rank of $G$ or the number of prime divisors of $|G|$ tends to infinity.

The \emph{power graph} $P(G)$ of a group $G$ is the graph whose vertex set is $G$, with $x$ and $y$ joined if one is a power of the other; the \emph{directed power graph} $\vec{P}(G)$ has the same vertex set, with an arc from $x$ to $y$ if…

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…

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…

The two graphs of the title both have vertex set G. In the intersection power graph, x and y are joined if some non-identity element is a power of both; in the power graph, x and y joined if one is a power of the other. Thus the power graph…

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $\Gamma_G$ associated to $G$ is the graph whose vertex set is $G\setminus Z(G)$ and two distinct elements $x,y$ are adjacent if and only if $xy\neq yx$.…

The reduced power graph $\mathcal{RP}(G)$ of a group $G$ is the graph with vertex set $G$ and two vertices $u$ and $v$ are adjacent if and only if $\left\langle v\right\rangle \subset \left\langle u \right\rangle $ or $\left\langle…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent if they differ by a single vertex and the two…

The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.

The purpose of this note is to define a graph whose vertex set is a finite group $G$, whose edge set is contained in that of the commuting graph of $G$ and contains the enhanced power graph of $G$. We call this graph the deep commuting…

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\subseteq…

The enhanced power graph of a group $G$ is the graph $P_e(G)$ whose vertex set is $G$, such that two distinct vertices $x$ and $y$, are adjacent if $\langle x, y\rangle$ is cyclic. In this paper, we analyze the structure of the enhanced…

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…