\documentstyle{SibMatJ} % \TestXML \topmatter \Author Lyngdoh \Initial D. \Sign Daphimosha Lyngdoh \Email daphisalyngdoh\@gmail.com \AffilRef 1 \endAuthor \Author Nongsiang \Initial D. \Sign Deiborlang Nongsiang \Email ndeiborlang\@yahoo.in \AffilRef 1 \Corresponding \endAuthor \Affil 1 \Division Department of Mathematics \Organization North-Eastern Hill University \City Meghalaya \Country India \endAffil \datesubmitted May 1, 2025\enddatesubmitted \dateaccepted November 7, 2025\enddateaccepted \UDclass ??? %\?05C10, 05C25 \endUDclass \thanks %\?сюда это из \acknowledgment The first author wishes to express her sincere thanks to CSIR (India) for its financial assistance. \endthanks \title On the Genus of the Nonnilpotent Graphs of Nonweakly Nilpotent Groups %\?Non- всюду слитно сделала \endtitle \abstract In this paper, we focus on a topological aspect, namely, the genus of the nonnilpotent graphs associated with nonweakly nilpotent groups. We determine the genus of the nonnilpotent graphs of some classes of finite nonnilpotent groups. We also classify all nonweakly nilpotent groups whose nonnilpotent graphs are planar, toroidal, double-toroidal, triple-toroidal, quadruple-toroidal, or pentuple-toroidal. \endabstract \keywords nonweakly nilpotent group, nonnilpotent graph, genus \endkeywords \endtopmatter \head 1. Introduction \endhead Let $G$ be a group and $\roman{nil}(G)=\{x \in G \mid \langle x,y\rangle$ is nilpotent for all $y\in G$\}. It is still unknown whether the subset $\roman{nil}(G)$ of $G$ is a subgroup of $G$ or not. In the case when $G$ is finite, $\roman{nil}(G)$ equals the hypercenter $Z^*(G)$ of $G$ (see [1, Lemma 3.1]). Associate with a group $G$, a (simple) graph $\goth{R}_G$ as follows: the vertex set $V(\goth{R}_G)$ is $G \setminus \roman{nil}(G)$ and two distinct vertices $x$ and $y$ are adjacent if and only if $\langle x,y\rangle$ is not nilpotent. We call $\goth{R}_G$, the nonnilpotent graph of $G$. The nonnilpotent graph can be seen as a generalization of the noncommuting graph, considered in [2] and [3]. Recently, in [4] and [5], the group and graph properties of the nonnilpotent graphs of groups were examined. For a finite nonnilpotent group $G$, in [4], Abdollahi and Zarrin, show that $\goth{R}_G$ is planar if and only if $G\cong S_3$ and in [5], Nongsiang and Saikia show that $\goth{R}_G$ is not toroidal. In this paper, we examine a topological feature, specifically the genus of nonnilpotent graphs associated with nonweakly nilpotent groups. In \Sec*{Section 2}, %\?\Sec*{Section 3}, как раз про это в Section 3 вроде we obtained some properties of the nonnilpotent graphs. We show that, if $G$ is a nonweakly nilpotent group (a~group $G$ is said to be weakly nilpotent if every two generated subgroups of $G$ are nilpotent) and if $\gamma(\goth{R}_G)=n$, where $n$ is a nonnegative integer, then $G$ is finite. We also show that, for any nonnegative integer $n$, there can be only finitely many nonweakly nilpotent groups whose nonnilpotent graphs are of genus $n$. In \Sec*{Section 4}, %\?опять про Section 3 ничего не написано we determine the genus of the nonnilpotent graphs of nonnilpotent groups of some well-known classes of finite groups and in \Sec*{Section 5}, we classify all nonweakly nilpotent groups whose nonnilpotent graphs are planar, toroidal, double-toroidal, triple-toroidal, quadruple-toroidal, or pentuple-toroidal. \head 2. Some Prerequisites \endhead In this section, we review specific group-theoretic and graph-theoretic terminology [6--8] along with some well-established results that will be referenced in the coming sections. The {\it nilpotent graph\/} of a group $G$ [1], denoted by $\Gamma_{\roman{nil}}(G)$, is a~simple undirected graph whose vertex set is $G\setminus \roman{nil}(G)$ and any two distinct vertices $x$ and $y$ are adjacent if and only if $\langle x,y\rangle$ is nilpotent. Let $\operatorname{Sol}(G) = \{x\in G : \langle x,y\rangle$ is solvable for all $y\in G\}$. The {\it nonsolvable graph\/} of $G$ [9], denoted by $\Cal{S}_G$, is a~simple undirected graph whose vertex set is $G\setminus \operatorname{Sol}(G)$ and any two distinct vertices $x$ and $y$ are adjacent if and only if $\langle x,y\rangle$ is not solvable. The {\it noncommuting graph\/} of $G$ [2], denoted by~$\Gamma_G$, is a~simple undirected graph whose vertex set is $G\setminus Z(G)$ and any two distinct vertices $x$ and $y$ are adjacent if and only if $x$ and $y$ do not commute. A graph is said to be {\it complete\/} if there exists an edge between every pair of distinct vertices in $\Gamma$. We denote the complete graph with $n$ vertices by $K_n$. The {\it complete bipartite graph\/} and the {\it complete tripartite graph\/} are the one whose vertex set can be partitioned into two disjoint parts and three disjoint parts, respectively, and two vertices are adjacent if and only if they lie in different parts. Similarly, a {\it complete multipartite graph\/} or a {\it complete $k$-partite graph\/} is a simple graph whose vertices can be partitioned into $k$ sets so that two distinct vertices $u$ and $v$ are adjacent if and only if $u$ and $v$ belong to different sets of the partition. We write $K_{n_1,\dots,n_k}$ for the complete $k$-partite graph with partite sets of sizes $n_1,\dots, n_k$. If $n_1=\dots= n_k=m$, then we get the regular complete $k$-partite graph $K_{m,m,\dots,m}$ and it is denoted by~$K_{k(m)}$. If $n_1=\dots= n_{l_1}=m_1,\dots,n_{l+1}=\dots= n_{l+l_r}=m_r$ $(l=l_1+l_2+\dots+l_{r-1})$ then we denote the complete $k$-partite graph $K_{n_1,\dots,n_k}$ by $K_{l_1(m_1),\dots,l_r(m_r)}$. Given a graph $\Gamma$, let $U$ be a nonempty subset of $V(\Gamma) $. Then the {\it induced subgraph\/} of $\Gamma$ on $U$ is defined to be the graph $\Gamma[U]$ in which the vertex set is $U$ and the edge set consists precisely of those edges in $\Gamma$ whose endpoints lie in $U$. The graph obtained by taking the union of graphs $\Gamma_1$ and $\Gamma_2$ with disjoint vertex sets is the disjoint union or sum, written %\?as $\Gamma_1 + \Gamma_2$. In general, $m\Gamma$ is the graph consisting of $m$ pairwise disjoint copies of $\Gamma$. The join of two graphs $\Gamma_1$ and $\Gamma_2$, denoted by $\Gamma_1 \vee \Gamma_2$, is the graph obtained from $\Gamma_1 +\Gamma_2$ by joining each vertex of $\Gamma_1$ to each vertex of $\Gamma_2$. Further, given a graph $\Gamma$, its {\it complement} is defined to be the graph in which the vertex set is the same as the one in $\Gamma$ and two distinct vertices are adjacent if and only if they are not adjacent vertices in $\Gamma$. The {\it genus\/} of a graph $\Gamma$, denoted by $\gamma(\Gamma)$, is the smallest nonnegative integer $n$ such that the graph can be embedded on the surface obtained by attaching $n$ handles to a sphere. Clearly, if $\widetilde{\Gamma}$ is a subgraph of~$\Gamma$, then $\gamma(\widetilde{\Gamma}) \leq \gamma(\Gamma)$. The sphere with one, two, three, four, and five handles are the {\it torus, double-torus, triple-torus, quadruple-torus, and pentuple-torus}, respectively. The graphs embeddable on the surfaces of genus 0, 1, 2, 3, 4, and 5 are the {\it planar, toroidal, double-toroidal, triple-toroidal, quadruple-toroidal, and pentuple-toroidal graphs}, respectively. A $block$ of a graph $\Gamma$ is a connected subgraph $B$ of $\Gamma$ that is maximal with respect to the property that removal of a single vertex (and the incident edges) from $B$ does not make it disconnected, that is, the graph $B\setminus\{v\}$ is connected for all $v\in V(B)$. Given a~graph~$\Gamma$, there is a unique finite collection $\goth {B}$ of blocks of $\Gamma$ such that $\Gamma = \bigcup\nolimits_{B\in \goth {B}}B$. The collection $\goth {B}$ is called the {\it block decomposition\/} of $\Gamma$. In [4, Theorem 1], it has been proved that the genus of a graph is the sum of the genera of its blocks. Some of the important helpful results are listed below: \proclaim{Lemma 2.1 \rm [8, Theorem 6-38]} If $n\geq 3$, then $$ \gamma(K_n)=\Bigl \lceil \frac{(n-3)(n-4)}{12}\Bigr \rceil. $$ \endproclaim \proclaim{Lemma 2.2 \rm [8, Theorem 6-37]} If $m,n\geq 2$, then $$ \gamma(K_{m,n})=\Bigl \lceil \frac{(m-2)(n-2)}{4}\Bigr \rceil. $$ \endproclaim \proclaim{Lemma 2.3 \rm [10, Theorem 6.1]} For all $n\neq 2$, $$ \gamma(K_{2n,n,n,n})=\Bigl \lceil \frac{(n-1)(3n-2)}{2}\Bigr \rceil. $$ \endproclaim \proclaim{Lemma 2.4 \rm [8, Corollary 6-14]} If $G$ is connected, with $p$ the number of vertices, $p\geq 3$, and $q$ the number of edges, then $\gamma(G) \geq \frac{q}{6}-\frac{p}{2} + 1$. Furthermore, equality %\?the holds if and only if a triangular embedding can be found for $G$. \endproclaim \head 3. Some Properties of Nonnilpotent Graphs \endhead Given a group $G$ with $x \in G$, the nilpotentizer of $x$ is defined as $\roman{nil}_G(x)=\{y \in G \mid \langle x,y\rangle$ is nilpotent\}. As in [4], a group $G$ is said to be an $\goth{n}$-group if $\roman{nil}_G(x)$ is a subgroup of $G$ for all $x \in G$ and a~group $G$ is said to be an $\goth{nn}$-group (see [1]), if $\roman{nil}_G(x)$ is a nilpotent subgroup of $G$ for all $x \in G\setminus \roman{nil}(G)$. We call $G$ an $\goth{n}_p$-group [4] if $\roman{nil}_G(x)$ is a subgroup of $G$ for all $p$-elements $x$ of $G$. A group $G$ is said to be an $AC$-group if the centralizer $C_G(x)$ of every noncentral element $x$ of $G$ is an abelian subgroup of $G$. For any group $G$, the upper central series of a group $G$ is given by $\{e\} = Z_0(G) \leq Z_1(G) \leq \cdots$, where $Z_{n+1}(G)/Z_n(G)$ is the center of $G/Z_n(G)$ for all $n \geq 0$. The subgroup $Z_n(G)$ is called the $n^{th}$-center %\?\it $n$th-center of~$G$. Clearly, $Z_1(G) = Z(G)$, the center of $G$. This series need not reach $G$, but if $G$ is finite then this %\?2 this series terminates at a subgroup called the hypercenter of $G$, denoted by $Z^*(G)$. We start this section with the following result, which allows us to use $Z^*(G)$ and $\roman{nil}(G)$ interchangeably, whenever the group $G$ is finite. \proclaim{Lemma 3.1 \rm [1, Lemma 3.1]} Let $G$ be a finite group. Then, the following assertions hold: \Item (1) $\langle x,Z^*(G)\rangle$ is nilpotent for every $x\in G$. \Item (2) $Z^*(G) =\roman{nil}(G)$. \endproclaim \proclaim{Lemma 3.2} A periodic finitely generated abelian group is finite. \endproclaim \demo{Proof} Let $G$ be a periodic finitely generated abelian group. Let $g_i$, $1\leq i\leq k$, be the generators of $G$ of order $n_i$. Every %\?Each element of $G$ can be written as a product of powers of these generators, i.e., if $x\in G$, then $x=g_1^{a_1}g_2^{a_2}....g_k^{a_k}$, %\?.... \dots или \cdots where $0\leq a_i\leq n_i$ for $1\leq i\leq k$. The number of such possible products is finite as $G$ is abelian and each $a_i$ can only take %\?take only finitely many values. Thus, $G$ is finite. \qed\enddemo \proclaim{Lemma 3.3} Let $G$ be a periodic finitely generated nilpotent group. Then, $G$ is finite. \endproclaim \demo{Proof} Let $m$ be the nilpotency class of $G$. We will prove the result by induction on the nilpotency class. If nilpotency class %\?the of $G$ is 1, then $G$ is abelian. By \Par*{Lemma 3.2}, $G$ is finite. Suppose the result holds for all groups of nilpotency class at most $m-1$. Let the upper central series of $G$ be $Z_0(G)\leq Z_1(G)\leq \dots \leq Z_m(G)=G$. Let $G_i=Z_{i+1}(G)/Z_1(G)$, $i=0,1,2,\dots,m-1$. Then $G_0\leq G_1\leq \dots \leq G_{m-1}$ forms a central series of $\overline{G}=G/Z_1(G)$ as $[\overline{G},G_{i+1}]\leq G_i$ for all $i=0,1,2,\dots,m-2$. It follows that $\overline{G}$ is nilpotent and its nilpotency class is at most $m-1$. By hypothesis, $\overline{G}$ is finite. Since $G$ is periodic finitely generated, we have %\?that $Z(G)$ is finitely generated, periodic, and abelian. By \Par*{Lemma 3.2}, $Z(G)$ is finite. Thus, $G$ is finite. \qed\enddemo \proclaim{Lemma 3.4} Let $G$ be a nonweakly nilpotent group and $x\in G\setminus \roman{nil}(G)$. If $\deg(x)$ in $\goth{R}_G$ is finite, then the order of $x$ is finite. \endproclaim \demo{Proof} Suppose $x$ has infinite order, that is, the order of the subgroup $\langle x\rangle$ is infinite. Since $x\in G\setminus\roman{nil}(G)$, there exist %\?exists $y\in G\setminus\roman{nil}(G)$ such that $\langle x,y\rangle$ is nonnilpotent. We will show that $\langle x,x^iy\rangle$ is nonnilpotent for all $i\in \Bbb{Z}$. Clearly, $x\in \langle x,x^iy\rangle$ and so $y\in \langle x,x^iy\rangle$. Thus, $\langle x,y\rangle= \langle x,x^iy\rangle$ and so $\langle x,x^iy\rangle$ is nonnilpotent for all $i\in \Bbb{Z}$. Hence, $\deg(x)$ is infinite, which is a contradiction. \qed\enddemo \proclaim{Lemma 3.5} Let $G$ be a nonweakly nilpotent group. Then $\goth{R}_G$ has at most one planar connected component. \endproclaim \demo{Proof} If $\goth{R}_G$ has no planar connected component, then there is nothing to prove. So suppose $\goth{R}_G$ has a planar connected component. Let $\Gamma$ be the subgraph of $\goth{R}_G$ consisting of all the planar connected components of $\goth{R}_G$. Firstly, we will show that $\circ(x)\leq 4$ for all $x\in V(\Gamma)$. Suppose that $x\in V(\Gamma)$ such that $\circ(x)>4$. Since $x\notin\roman{nil}(G)$, there exist %\?exists $y\in G\setminus\roman{nil}(G)$ such that $\langle x,y\rangle$ is nonnilpotent. Note that $y \in V(\Gamma)$. Suppose $\circ(y)>2$. Clearly, $x^{-1},y^{-1},xy,yx,xy^{-1}\notin\roman{nil}(G)$. Suppose $|xy|=2$. Then $yx=x^{-1}y^{-1}$ and so the element $xy^{-1}$ is distinct from $x,x^{-1},y,y^{-1},xy,yx$. %\?$x$, $x^{-1}$, $y$, $y^{-1}$, $xy$, $yx$. Let $H=\{x,x^{-1},y,y^{-1},xy,yx,xy^{-1}\}$ and $\Gamma'=\goth{R}_G[H]$. Then, $\Gamma'$ contains $K_{3,2,2}$ as a subgraph with partite sets $\{x,x^{-1}\}$, $\{y,y^{-1}\}$, and $\{xy,yx,xy^{-1}\}$. Since $x\in V(\Gamma')$ and $\Gamma'$ is connected, we have %\?that $\Gamma'$ is a subgraph of $\Gamma$, which is a contradiction. So, suppose $|xy|>2$. Now $(xy)^{-1}\notin\roman{nil}(G)$. If $(xy)^{-1}\neq yx$, then $\Gamma$ contains $K_{3,2,2}$ as a subgraph with partite sets $\{x,x^{-1}\}$, $\{y,y^{-1}\}$, and $\{xy,yx,(xy)^{-1}\}$, which is not planar. If $(xy)^{-1}=yx$, then $y^2=x^{-2}$ and if $x^{-1}y=yx$, then $y = xyx$ and so $y^2 = xyx^2yx =xy(y^{-1})^2yx = x^2$, that is %\?, $x^4 = e$; a contradiction. It follows that $x^{-1}y\neq yx$. Since $x^{-1}y \notin\roman{nil}(G)$ is distinct from $x,x^{-1},y, y^{-1},xy$, %\?$x$, $x^{-1}$, $y$, $y^{-1}$, $xy$, we have %\?that $\Gamma$ contains $K_{3,2,2}$ as a subgraph with partite sets $\{x,x^{-1}\}$, $\{y,y^{-1}\}$, and $\{xy,yx,x^{-1}y\}$, which is not planar. Thus $\circ(y)>2$ is not possible. Suppose $\circ(y)=2$. If $|xy|>2$, then $\Gamma$ contains $K_{3,2,1}$ as a subgraph with partite sets $\{x,x^{-1}\}$, $\{y\}$, and $\{xy,yx,(xy)^{-1}\}$, which is not planar. If $|xy|=2$, then $\langle x,y\rangle\cong D_{2|x|}$ and either $D_{2|x|}$ is nilpotent or $\Gamma$ contains $\goth{R}_{D_{2|x|}}$ which is a connected nonplanar graph; a contradiction. Hence, $|x|\leq 4$ for all $x\in V(\Gamma)$. Secondly, we will prove the existence of $2$-elements and $3$-elements in $V(\Gamma)$. Let $x,y\in V(\Gamma)$ such that $\langle x,y\rangle$ is nonnilpotent. Suppose $V(\Gamma))$ consists of only $2$-elements. If $|x|=|y|=|xy|=2$, then $xy=yx$; a contradiction. If $|x|=|y|=2$ and $|xy|=4$, then $\langle x,y\rangle\cong D_8$, which is nilpotent. If $|x|=2$, $|y|=4$ and $|xy|=2$, then again $\langle x,y\rangle\cong D_8$, which is nilpotent. If $|x|=2$, $|y|=4$, $|xy|=4$ and if $yx=xy^{-1}$, then $\langle x,y\rangle\cong D_8$. If $|x|=2$, $|y|=4$, $|xy|=4$ and if $yx\neq xy^{-1}$, then $\Gamma$ contains $K_{3,2,1}$ as a subgraph with partite sets $\{x\}$, $\{y,y^{-1}\}$, and $\{xy,yx,xy^{-1}\}$, which is not planar. If $|x|=|y|=4$ and $|xy|=2$, then $yx=x^{-1}y^{-1}$ and so $yx\neq xy^{-1}$. Thus $\Gamma$ contains $K_{3,2,2}$ as a subgraph with partite sets $\{x,x^{-1}\}$, $\{y,y^{-1}\}$, and $\{xy,yx,xy^{-1}\}$, which is not planar. If $|x|=|y|=|xy|=4$ and $(xy)^{-1}=x^{-1}y=xy^{-1}=yx$, then $\langle x,y\rangle\cong Q_8$, which is a contradiction. Thus $\Gamma$ contains $K_{3,2,2}$ as a subgraph with partite sets $\{x,x^{-1}\}$, $\{y,y^{-1}\}$, and $\{xy,yx, u\}$, where $u\in \{(xy)^{-1},x^{-1}y,xy^{-1}\}, u\neq yx$, which is a contradiction. Thus, there exists a $3$-element in $V(\Gamma)$. If $V(\Gamma))$ consists of only $3$-elements, i.e., if $|x|=|y|=|xy|=3$, then $\Gamma$ contains $K_{3,2,2}$, as a subgraph with partite sets $\{x,x^{-1}\}$, $\{y,y^{-1}\}$, and $\{xy,yx,y^{-1}x^{-1}\}$, which is not planar. Thus, there exists a $2$-element in $V(\Gamma)$. Now, we will show that $\Gamma$ is connected. Suppose $x,y\in V(\Gamma)$ such that $\langle x,y\rangle$ is nilpotent. Then, by \Par*{Lemma 3.3}, $\langle x,y\rangle$ is finite. If $x$ is a $2$-element and $y$ is a $3$-element, then since $\operatorname{gcd}(|x|,|y|)=1$, we have $\langle x,y\rangle=\langle xy\rangle$ (by [11, Lemma 2.2]). Since $x,y\notin\roman{nil}(G)$, there exist $u,v\in G\setminus\roman{nil}(G)$ such that $\langle x,u\rangle$ and $\langle y,v\rangle$ are nonnilpotent and thus $u,v\in V(\Gamma)$. Now, $\langle x,u\rangle\subseteq \langle xy,u\rangle$ and $\langle y,v\rangle\subseteq \langle xy,v\rangle$. Thus, $xy$ is adjacent to both $u$ and $v$ and $x-u-xy-v-y$ is the path connecting $x$ and $y$. If $x$ and $y$ are both $2$-elements then by the previous argument $\exists$ %\?there exists a~$3$-element $z$ which is connected to $x$ and $y$ and thus there exists a path connecting $x$ and $y$. If $x$ and $y$ and both $3$-elements, then by the same argument, $\exists$ %\?there exists a~$2$-element $z$ which is connected to $x$ and $y$ and thus there exists a path connecting $x$ and $y$. Thus, $\Gamma$ is connected. Hence $\goth{R}_G$ has at most one planar connected component. \qed\enddemo \proclaim{Theorem 3.6} Let $G$ be a nonweakly nilpotent group and $n\in \Bbb{N}\cup \{0\}$. If $\gamma(\goth{R}_G)=n$, then $G$ is finite. \endproclaim \demo{Proof} Since $\gamma(\goth{R}_G)=n$; therefore, $\goth{R}_G$ has an embedding in $S_n$. By [8, Definition 6-10], the embedding is a minimal embedding. If $\goth{R}_G$ is connected, then by [8, Theorem 6-11], the embedding of $\goth{R}_G$ is a 2-cell embedding or a cellular embedding. By [12, Proposition 3.1], $\goth{R}_G$ must be finite and hence by [5, Proposition 4.2] $G$ is finite. If $\goth{R}_G$ is disconnected, then the number of nonplanar connected components of $\goth{R}_G$ is finite (since $\gamma(\goth{R}_G)=n$) and by \Par*{Lemma 3.5}, there is at most one planar connected component. Each of these connected components of $\goth{R}_G$ is also finite, otherwise it would contradict [12, Proposition 3.1]. Hence, $\goth{R}_G$ is finite which implies that $G$ is finite by [5, Proposition 4.2]. \qed\enddemo \proclaim{Proposition 3.7} Let $n$ be a nonnegative integer. Then, there are finitely many nonweakly nilpotent groups whose nonnilpotent graphs are of genus $n$. \endproclaim \demo{Proof} Let $G$ be a nonweakly nilpotent group such that $\gamma(\goth{R}_G)=n$. Then by \Par*{Theorem 3.6}, $G$ is a~finite group. If $n=0$, then by [4, Theorem 6.1], there is only one finite nonnilpotent group whose nonnilpotent graph is planar, namely $S_3$. So suppose $n\geq 1$. Let $h=\lfloor\frac{7+ \sqrt{1+48n}}{2} %\? \rfloor$ and $\omega(\goth{R}_G)=m$. By Heawood's formula [7, Theorem~6.3.25], we have $m\leq \chi(\goth{R}_G)\leq h$. If $G$ is a solvable group, then by [4, Theorem 4.4], $|G/Z^*(G)|2$, and $p\nmid q-1$ is nilpotent. \endproclaim \demo{Proof} Let $G$ be a group of order $p^2q$. Let $n_p$ and $n_q$ be the number of Sylow $p$-subgroups and Sylow $q$-subgroups of $G$ respectively. Then, $n_q=1$ or $p^2$. If $n_q=p^2$, then $p^2\equiv 1(\text{mod q})$. %\? Thus $q\mid (p+1)$ and so $p=2,q=3$, which is a contradiction. Thus, $n_q=1$. Since $p\nmid q-1$, we have $n_p=1$. Thus, every Sylow subgroup of $G$ is unique which implies that $G$ is the direct product of its Sylow subgroups. Hence, the result follows. \qed\enddemo \proclaim{Lemma 4.16} Let $x$ be a $q$-element or an element of order $pq$ of a group $G$, where $p$ and $q$ are primes, $p2$, $p\nmid q-1$, and $p\mid q+1$. Then, $$ \goth{R}_G\cong\cases K_{q^2-1,q^2(p^2-1)}, & \text{if }|Z^*(G)|=1, \\ K_{pq^2-p,q^2(p^2-p)}, & \text{if }|Z^*(G)|=p. \endcases $$ In particular, $$ \gamma(\goth{R}_G)= \cases \gamma(K_{q^2-1,q^2(p^2-1)}), & \text{if }|Z^*(G)|=1, \\ \gamma(K_{pq^2-p,q^2(p^2-p)}), & \text{if }|Z^*(G)|=p. \endcases $$ \endproclaim \demo{Proof} Here, every Sylow subgroup of $G$ is abelian and so by [4, Lemma 3.5], $G$ is an $\goth{n}_p$-group, an $\goth{n}_q$-group, and $C_G(x)=\roman{nil}_G(x)$ for every %\? $p$-element and $q$-element $x$ of $G$. Thus, by [4, Lemma 3.4], $G$ is an $\goth{n}$-group. Let $n_p$ and $n_q$ be the number of Sylow $p$-subgroups and Sylow $q$-subgroups of $G$ respectively. Then, $n_q=1$ or $p^2$. If $n_q=p^2$, then $p=2$ and $q=3$, which is a contradiction. Thus, $n_q=1$ and since $G$ is nonnilpotent, therefore $n_p=q^2$. Now, for any $p$-element or $q$-element $x$ of $G\setminus Z^*(G)$, if $|C_G(x)|=p^2$ or $q^2$, then $C_G(x)$ is abelian and thus nilpotent. If $|C_G(x)|=p^2q$ or $pq^2$, then by \Par{Lemma 4.15}{Lemmas 4.15} and \Par{Lemma 4.16}{4.16}, $C_G(x)$ is nilpotent. If $x\in G\setminus Z^*(G)$ is an element of order $pq$, then $|\roman{nil}_G(x)|=pq$ or $p^2q$ or $pq^2$. Using \Par{Lemma 4.15}{Lemmas 4.15} and \Par{Lemma 4.16}{4.16}, $\roman{nil}_G(x)$ is nilpotent. If $x\in G\setminus Z^*(G)$ is an element of order $p^2q$, then $|\roman{nil}_G(x)|=p^2q$ and so $\roman{nil}_G(x)$ is cyclic and thus nilpotent. Similar argument holds if $x\in G\setminus Z^*(G)$ is an element of order $pq^2$. Hence, $G$ is an $\goth{nn}$-group. Let $P_1,P_2,\dots,P_{q^2}$ be the Sylow $p$-subgroups of $G$. Let $Q$ be the Sylow $q$-subgroup of $G$. {\sc Case I}: \Label{CI} $|Z^*(G)|=1$. Let $x\in Q\setminus Z^*(G)$. Suppose $|\roman{nil}_G(x)|=pq^2$. Let $y\in\roman{nil}_G(x)$ such that $\circ(y)=p$. Then $y\in P_i$ for some $i$. Therefore $\roman{nil}_G(x),P_i\subset\roman{nil}_G(y)$ and so $|\roman{nil}_G(y)|=p^2q^2$, that is %\?, $y\in Z^*(G)$; a contradiction. Thus $|\roman{nil}_G(x)|=q^2$ and so $\roman{nil}_G(x)=Q$. Similarly, if $x\in P_i\setminus Z^*(G)$, then $\roman{nil}_G(x)=P_i$. If $i\neq j$ and $x\in P_i\cap P_j$, then $P_i,P_j\subset\roman{nil}_G(x)$ and so $\roman{nil}_G(x)=G$. Thus $x=e$. It follows that $G=P_1\cup P_2\cup\dots\cup P_{q^2}\cup Q$ and $P_1, P_2,\dots, P_{q^2}, Q$ are the distinct nilpotentizers of $G$. Thus, in view of \Par*{Proposition 4.1}, we have $\goth{R}_G\cong K_{q^2-1,q^2(p^2-1)}$. {\sc Case II}: $|Z^*(G)|=p$. As in \Par{CI}{Case I}, we see that if $x\in P_i\setminus Z^*(G)$, then $\roman{nil}_G(x)=P_i$ and if $x\in QZ^*(G)\setminus Z^*(G)$, then $\roman{nil}_G(x)=QZ^*(G)$. Note that $P_i\cap P_j=Z^*(G)$ for $i\neq j$ and $P_j\cap QZ^*(G)=Z^*(G)$. Thus $G=P_1\cup P_2\cup\dots\cup P_{q^2}\cup QZ^*(G)$ and $P_1, P_2,\dots, P_{q^2}, QZ^*(G)$ are the distinct nilpotentizers of $G$. Thus, in view of \Par*{Proposition 4.1}, we have $\goth{R}_G\cong K_{pq^2-p,q^2(p^2-p)}$. {\sc Case III}: If $|Z^*(G)|=q$, then $|\frac{G}{Z^*(G)}|=p^2q$ and so by \Par*{Lemma 4.15}, $\frac{G}{Z^*(G)}$ is nilpotent. Since $Z^*(G)$ is nilpotent, we have $G$ is nilpotent; a contradiction. If $|Z^*(G)|=pq$, then $|\frac{G}{Z^*(G)}|=pq$ and so, since $p\nmid q-1$, we have $\frac{G}{Z^*(G)}$ is cyclic and hence nilpotent. Since $Z^*(G)$ is nilpotent, we have $G$ is nilpotent; a contradiction. Similarly $|Z^*(G)|\neq p^2q,pq^2$. This completes the proof. \qed\enddemo \proclaim{Lemma 4.18}\Label{L4.18} Let $G$ be a group of order $pqr$, where $p$, $q$, and $r$ are distinct primes and $ppqr$; a contradiction. Thus, $n_q=1$. Let $Q$ be the normal Sylow $q$-subgroup of $G$. The quotient group $G/Q$ has order $pr$ which implies that $G/Q$ has a normal Sylow $r$-subgroup $N/Q$. Then, by the correspondence theorem, %\? $N$ is a normal subgroup of $G$ of order $qr$. Again, $N$ has a normal Sylow $r$-subgroup, say $M$. Since $M$ is a normal Sylow $r$-subgroup of $N$ and $N$ is normal in $G$, it follows that $M$ is normal in $G$; a contradiction to the fact that $n_r=pq$. Thus, \Par{L4.18}{(a)} holds. \Par{L4.18}{(b)}: Let $H$ and $K$ be Sylow $q$-subgroup and Sylow $r$-subgroup of $G$, respectively. Since $K$ is normal in $G$, therefore $HK$ is a subgroup of $G$. Also, $H\cap K$ is trivial. Thus, $|HK|=qr$. Now $I_G(HK)=p$ and since $p$ is the smallest prime dividing $|G|$, therefore $HK$ is normal in $G$. Hence, the result follows. \Par{L4.18}{(c)}: Let $H$ and $K$ be as in \Par{L4.18}{(b)}. Since $q\nmid r-1$, the subgroup $HK$ is cyclic, which implies that $HK$ is abelian. Since $H$ is a subgroup of $HK$, we have $H$ is a normal subgroup of $G$. Thus, \Par{L4.18}{(c)} holds. \qed\enddemo \proclaim{Proposition 4.19} Let $G$ be a nonnilpotent group of order $pqr$, where $p$, $q$, and $r$ are distinct primes, $p0$. Let $q=2^{2m+1}$, $r=2^m$, and $s=|Z^*(G)|$. Then, $\goth{R}_G$ is isomorphic to the complete $(q^2+1)+\frac{q^2(q^2+1)}{2}+\frac{q^2(q^2+1)(q-1)}{4(q+2r+1)}+\frac{q^2(q^2+1)(q-1)}{4(q-2r+1)}$-partite graph $$K_{(q^2+1)(q^2-s),\frac{q^2(q^2+1)}{2}(q-1-s),\frac{q^2(q^2+1)(q-1)}{4(q+2r+1)}(q+2r+1-s),\frac{q^2(q^2+1)(q-1)}{4(q-2r+1)}(q-2r+1-s)}. $$ In particular, $$ \gamma(\goth{R}_G)=\gamma \bigl(K_{(q^2+1)(q^2-s),\frac{q^2(q^2+1)}{2}(q-1-s),\frac{q^2(q^2+1)(q-1)}{4(q+2r+1)}(q+2r+1-s),\frac{q^2(q^2+1)(q-1)}{4(q-2r+1)}(q-2r+1-s)} \bigr). $$ \endproclaim \demo{Proof} Here, $G$ is a simple group of order $q^2(q^2+1)(q-1)$. By [5, Proposition 3.7], \Item (a) $G$ has a Sylow $2$-subgroup $F$ of order $q^2$ and $|\{F^x$ : $x\in G\}|=q^2+1$. \Item (b) $G$ contains a cyclic subgroup $A$ of order $q-1$ and $|\{A^x$ : $x\in G\}|=q^2(q^2+1)/2$. \Item (c) $G$ contains a cyclic subgroup $B$ of order $q+2r+1$ and $|\{B^x$ : $x\in G\}|=q^2(q^2+1)(q-1)/4(q+2r+1)$. \Item (d) $G$ contains a cyclic subgroup $C$ of order $q-2r+1$ and $|\{C^x$ : $x\in G\}|=q^2(q^2+1)(q-1)/4(q-2r+1)$. \Item (e) Suppose $x$ is a nontrivial element of $G$. Then, $$ \roman{nil}_G(x)= \cases F^x, & \text{if }x\in F^x,\\ A^x, & \text{if }x\in A^x,\\ B^x, & \text{if }x\in B^x,\\ C^x, & \text{if }x\in C^x. \endcases $$ In particular, $G$ is an $\goth{nn}$-group and thus by \Par*{Proposition 4.1}, $$ \goth{R}_G\cong K_{(q^2+1)(q^2-s),\frac{q^2(q^2+1)}{2}(q-1-s),\frac{q^2(q^2+1)(q-1)}{4(q+2r+1)}(q+2r+1-s),\frac{q^2(q^2+1)(q-1)}{4(q-2r+1)}(q-2r+1-s)}$$ and the result follows. \qed\enddemo \proclaim{Proposition 4.23} Let $G\cong \Bbb{Z}_m\rtimes \Bbb{Z}_{2n}=\langle a,x : a^m=x^{2n}=1, xax^{-1}=a^{-1}\rangle$, where $m$ is odd, $n=2^t$, and $t\geq 2$. Then, $\goth{R}_G$ is isomorphic to the complete $(m+1)$-partite graph $K_{mn-n,m(n)}$ and $\gamma(\goth{R}_G)=\gamma(K_{mn-n,m(n)})$. In particular, if $m=3$, then $\gamma(\goth{R}_G)= \lceil \frac{(n-1)(3n-2)}{2} \rceil$. \endproclaim \demo{Proof} The group $G$ is a nonnilpotent $\goth{nn}$-group with $Z^*(G)=\langle x^2\rangle$. For $1\leq i5$. Thus $|G|=2^r3^s5^t7^u$. If $2$ is the smallest prime dividing the order of $G$, then by \Par*{Lemma 5.3}, $|G|< 17$. If $3$ is the smallest prime dividing the order of $G$, then by \Par*{Lemma 5.3}, $|G|< 14$. If $5$ is the smallest prime dividing the order of $G$, then by \Par*{Lemma 5.3}, $|G|< 12$. Thus $G$ is isomorphic to $S_3$, $D_{10}$, $A_4$, $D_{14}$, $Q_{12}$, or $D_{12}$. By [4, Theorem 6.1], $\goth{R}_{S_{3}}$ is planar. The group $D_{10}$ is a {\it centerless AC-group\/} and so by [5, Lemma 4.5], $\goth{R}_G \cong \Gamma (G)$, where $\Gamma (G)$ is the noncommuting graph of G. It follows from [5, Proposition~5.5] that $\goth{R}_{D_{10}}$ is double-toroidal. By [5, Remark 5.2], $\goth{R}_{D_{12}}\cong \goth{R}_{Q_{12}}\cong K_{4,2,2,2}$. Thus, by [10, Corollary~6.2], $\gamma (\goth{R}_{D_{12}}) = \gamma (\goth{R}_{Q_{12}})=3$. By [5, Remark 5.2], $4\leq \gamma(\goth{R}_{A_4})\leq 5$. The nonnilpotent graph of the group $D_{14}$ is isomorphic to $K_{6,1,1,1,1,1,1,1}$. The graph $K_{6,1,1,1,1,1,1,1}$ has $13$ vertices and $63$ edges and so, by \Par*{Lemma 4.25}, we have $\gamma(\goth{R}_{D_{14}})\geq 5$. Note that $\goth{R}_{D_{14}}\cong K_{13}-K_6$ and by [16], $K_{13}-K_6$ has no triangular embedding. Thus, $\goth{R}_{D_{14}}$ has no triangular embedding. It follows from \Par*{Lemma 4.25} that $\gamma(\goth{R}_{D_{14}})> 5$. This completes the proof. \qed\enddemo \acknowledgment The authors would like to thank the referee for his/her valuable comments and suggestions. The first author wishes to express her sincere thanks to CSIR (India) for its financial assistance. %\?это в \thanks надо, пока поместила, может, номер гранта укажут \Refs \ref\no 1 \by Das~A.K. and Nongsiang~D. \paper On the genus of the nilpotent graphs of finite groups \jour Comm. Algebra \yr 2015 \vol 43 \issue 12 \pages 5282--5290 \endref \ref\no 2 \by Abdollahi~A., Akbari~S., and Maimani H.R. %A. Akbari \paper Non-commuting graph of a group \jour J.~Algebra \yr 2006 \vol 298 \issue 2 \pages 468--492 \endref \ref\no 3 \by Darafsheh M.R. \paper Groups with the same non-commuting graph \jour Discrete Appl. Math. \yr 2009 \vol 157 \issue 4 \pages 833--837 \endref \ref\no 4 \by Abdollahi~A. and Zarrin M. \paper Non-nilpotent graph of a group \jour Comm. Algebra \yr 2010 \vol 38 \issue 12 \pages 4390--4403 \endref \ref\no 5 \by Nongsiang~D. and Saikia~P.K. \paper On the non-nilpotent graphs of a group \jour Int. Electron. J. Algebra \yr 2017 \vol 22 %\issue - \pages 78--96 \endref \ref\no 6 \by Bondy J.A. and Murty U.S.R. \book Graph Theory with Applications \publ American Elsevier \publaddr New York \yr 1976 \endref \ref\no 7 \by West D.B. \book Introduction to Graph Theory \bookinfo Second Edition \publ PHI Learning Private Limited \publaddr New Delhi \yr 2009 \endref \ref\no 8 \by White A.T. \book Graphs, Groups and Surfaces \publ North-Holland and American Elsevier \publaddr Amsterdam, London, and New York \yr 1973 \finalinfo North-Holland Math. Stud., 8 \endref \ref\no 9 \by Bhowal P., Nongsiang D., and Nath~R.K. \paper Non-solvable graphs of groups \jour Bull. Malays. Math. Sci. Soc. \yr 2022 \vol 45 \issue 3 \pages 1255--1272 \endref \ref\no 10 \by Ellingham M.N. and Schroeder J.Z. \paper Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications \jour J. Graph Theory \yr 2014 \vol 77 \issue 3 \pages 219--236 \endref \ref\no 11 \by \D Zak R. \paper A few remarks on the theory of non-nilpotent graphs \jour Comm. Algebra \yr 2023 \vol 51 \issue 11 \pages 4604--4613 \endref \ref\no 12 \by Mohar B. \paper Embeddings of infinite graphs \jour J. Combin. Theory Ser. B \yr 1988 \vol 44 \issue 1 \pages 29--43 \endref \ref\no 13 \by Abdollahi A. and Mohammadi Hassanabadi~A. \paper Finite groups with a certain number of elements pairwise generating a non-nilpotent subgroup \jour Bull. Iranian Math. Soc. \yr 2004 \vol 30 \issue 2 \pages 1--20 \endref \ref\no 14 \by Fulman J.E., Galloy M.D., Sherman G.J., and Vanderkam~J.M. \paper Counting nilpotent pairs in finite groups \jour Ars Combin. \yr 2000 \vol 54 %\issue \pages 161--178 \endref \ref\no 15 \by Feit W. and Thompson J.G. \paper Solvability of groups of odd order \jour Pacific J. Math. \yr 1963 \vol 13 %\issue - \pages 775--1029 \endref \ref\no 16 \by Jungerman M. \paper Orientable triangular embeddings of $K_{18}—K_{3}$ and $K_{13}—K_{3}$ \jour J. Combinatorial Theory Ser. B \yr 1974 \vol 16 \issue 3 \pages 293--294 \endref \endRefs \enddocument