Related papers: On Finite groups whose power graphs are line graph…
In this paper, we study the oriented diameter of power graphs of groups. We show that a $2$-edge connected power graph of a finite group has oriented diameter at most $4$. We prove that the power graph of the cyclic group of order $n$ has…
We introduce a special class of powerful $p$-groups that we call powerfully nilpotent groups that are finite $p$-groups that possess a central series of a special kind. To these we can attach the notion of a powerful nilpotence class that…
Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…
In this article we present an extensive survey on the developments in the theory of non-abelian finite groups with abelian automorphism groups, and pose some problems and further research directions.
We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…
In this paper, we systematically investigate the nilpotentizer and nilpotent graph for a Lie superalgebra over the field of characteristic not equal to 2. First, we establish some fundamental properties of the nilpotentizer. Next, we show…
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…
For a finite group $G$ with a normal subgroup $H$, the normal subgroup based power graph of $G$, denoted by $\Gamma_H(G)$ whose vertex set $V(\Gamma_H(G))=(G\setminus H)\bigcup \{e\}$ and two vertices $a$ and $b$ are edge connected if…
A subgroup $H$ of a group $G$ is said to be an $IC\Phi$-subgroup of $G$ if $H \cap [H,G] \le \Phi(H)$. We analyze the structure of a finite group $G$ under the assumption that some given subgroups of $G$ are $IC\Phi$-subgroups of $G$. A new…
In this paper, we discuss about finite groups in which, CGH = NGH, for every abelian subgroup H of non prime power order. Also, we classify all such nilpotent and minimal non nilpotent groups.
We consider linear groups and Lie groups over a non-Archimedean local field $\mathbb F$ for which the power map $x\mapsto x^k$ has a dense image or it is surjective. We prove that the group of $\mathbb F$-points of such algebraic groups is…
For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…
The proper commuting graph $\mathcal{C}^{**}(G)$ of a finite group $G$ is the simple graph whose vertices are the noncentral elements of $G$ and two distinct vertices are adjacent if they commute. In this paper, we study the domination…
The power graph \( \mathcal{G}_G \) of a group \( G \) is a graph whose vertex set is \( G \), and two elements \( x, y \in G \) are adjacent if one is an integral power of the other. In this paper, we determine the adjacency, Laplacian,…
In this paper we consider the palindromic width of free nilpotent groups. In particular, we prove that the palindromic width of a finitely generated free nilpotent group is finite. We also prove that the palindromic width of a free…
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)…
We prove a characterization of monomial projective representations of finitely generated nilpotent groups. We also characterize polycyclic groups whose projective representations are finite dimensional.
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…
The {\em power index} $\Theta(\Gamma)$ of a graph $\Gamma$ is the least order of a group $G$ such that $\Gamma$ can embed into the power graph of $G$. Furthermore, this group $G$ is {\em $\Gamma$-optimal} if $G$ has order $\Theta(\Gamma)$.…
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…