arXiv subjects

Deiborlang Nongsiang

Publications and source records attributed to Deiborlang Nongsiang.

6 recordsLinked to original sources

arXiv2026

Engel and co-Engel graphs of finite groups

Let $G$ be a group. Associate a directed graph $\vec{E}(G)$ (called the Engel digraph of $G$) with $G$ whose vertex set is $G$, with an arc $(x,y)$ if $[y, {}_k x]=1$ for some positive integer $k$, where $[y,{}_kx]$ is the iterated commutator $[y,x,x,\ldots,x]$, with $k$ terms $x$ in the expression. From this we define the Engel graph $E(G)$ by ignoring directions; the co-Engel graph $E_c(G)$ is its complement. The co-Engel graph, under the name ``Engel graph'', was introduced by Abdollahi. However, the name we use is more natural. We begin with some general results about the Engel digraph and graph, before turning our attention to the co-Engel graph. Among other things, we show that the undirected Engel graph does not determine the directed version up to isomorphism, though counterexamples seem to be fairly rare: there are just two orders less than $100$ for which this happens. We also prove a universality theorem: every finite digraph is an induced sub-digraph of the Engel digraph of a finite group. The isolated vertices of $E_c(G)$ form the Fitting subgroup $F(G)$ of $G$. In this paper, we realize the induced subgraph of co-Engel graphs of certain finite non-Engel groups $G$ induced by $G \setminus F(G)$. We write $E_c^-(G)$ to denote the subgraph of $E_c(G)$ induced by $G \setminus F(G)$. We also compute genus, various spectra, energies and Zagreb indices of $E_c^-(G)$ for those groups. As a consequence, we determine (up to isomorphism) all finite non-Engel group $G$ such that the clique number of $E_c^-(G)$ is at most $4$ and $E_c^-(G)$ is toroidal or projective. Further, we show that $E_c^-(G)$ is ALQ-integral and satisfies the E-LE conjecture and the Hansen-Vuki{č}evi{ć} conjecture for the groups considered in this paper.

math.GR↗

arXiv2024

Characterization of commuting graphs of finite groups having small genus

In this paper we first show that among all double-toroidal and triple-toroidal finite graphs only $K_8 \sqcup 9K_1$, $K_8 \sqcup 5K_2$, $K_8 \sqcup 3K_4$, $K_8 \sqcup 9K_3$, $K_8\sqcup 9(K_1 \vee 3K_2)$, $3K_6$ and $3K_6 \sqcup 4K_4 \sqcup 6K_2$ can be realized as commuting graphs of finite groups. As consequences of our results we also show that for any finite non-abelian group $G$ if the commuting graph of $G$ (denoted by $Γ_c(G)$) is double-toroidal or triple-toroidal then $Γ_c(G)$ and its complement satisfy Hansen-Vuki{č}evi{ć} Conjecture and E-LE conjecture. In the process we find a non-complete graph, namely the non-commuting graph of the group $(\mathbb{Z}_3 \times \mathbb{Z}_3) \rtimes Q_8$, that is hyperenergetic. This gives a new counter example to a conjecture of Gutman regarding hyperenergetic graphs.

math.GR↗

arXiv2019

Non-solvable graphs of groups

Let $G$ be a group and $Sol(G)=\{x \in G : \langle x,y \rangle \text{ is solvable for all } y \in G\}$. We associate a graph $\mathcal{NS}_G$ (called the non-solvable graph of $G$) with $G$ whose vertex set is $G \setminus Sol(G)$ and two distinct vertices are adjacent if they generate a non-solvable subgroup. In this paper we study many properties of $\mathcal{NS}_G$. In particular, we obtain results on vertex degree, cardinality of vertex degree set, graph realization, domination number, vertex connectivity, independence number and clique number of $\mathcal{NS}_G$. We also consider two groups $G$ and $H$ having isomorphic non-solvable graphs and derive some properties of $G$ and $H$. Finally, we conclude this paper by showing that $\mathcal{NS}_G$ is neither planar, toroidal, double-toroidal, triple-toroidal nor projective.

math.GR↗

arXiv2019

A note on solvable graphs of finite groups

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $Γ_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 \rangle$ is solvable. We show that $Γ_s (G)$ is not a star graph, a tree, an $n$-partite graph for any positive integer $n \geq 2$ and not a regular graph for any non-solvable finite group $G$. We compute the girth of $Γ_s (G)$ and derive a lower bound of the clique number of $Γ_s (G)$. We prove the non-existence of finite non-solvable groups whose solvable graphs are planar, toroidal, double-toroidal, triple-toroidal or projective. We conclude the paper by obtaining a relation between $Γ_s (G)$ and the solvability degree of $G$.

math.GR↗

arXiv2013

On reduced zero-divisor graphs of posets

In this paper we study some of the basic properties of a graph which is constructed from the equivalence classes of non-zero zero-divisors determined by annihilator ideals of a poset. In particular, we demonstrate how this graph helps in identifying the annihilator prime ideals of a poset that satisfies the ascending chain condition for its proper annihilator ideals.

math.AC↗

arXiv2013

On the genus of the commuting graphs of finite non-abelian groups

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism) all finite non-abelian groups whose commuting graphs are acyclic, planar or toroidal. We also derive explicit formulas for the genus of the commuting graphs of some well-known class of finite non-abelian groups, and show that, every collection of finite non-abelian groups whose commuting graphs have the same genus is finite.

math.GR↗