Related papers: Characterizing finite nilpotent groups associated …

We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…

A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group $G$ is weakly perfect: its clique number and chromatic number are equal to the maximum order of an…

The power graph denoted by $\mathcal{P}(\mathcal{G})$ of a finite group $\mathcal{G}$ is a graph with vertex set $\mathcal{G}$ and there is an edge between two distinct elements $u, v \in \mathcal{G}$ if and only if $u^m = v$ or $v^m = u$…

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.

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…

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…

In this article, various aspects of Laplacian spectra of power graphs of finite cyclic, dicyclic and finite $p$-groups are studied. Algebraic connectivity of power graphs of the above groups are considered and determined completely for that…

This article investigates neighborhoods' sizes in the enhanced power graph (as known as the cyclic graph) associated with a finite group. In particular, we characterize finite $p$-groups with the smallest maximum size for neighborhoods of…

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…

We study the class of groups having the property that every non-nilpotent subgroup is equal to its normalizer. These groups are either soluble or perfect. We completely describe the structure of soluble groups and finite perfect groups with…

In this paper, we investigate the edge-coloring number of the power graph of a finite group. We characterize which finite groups have overfull power graphs, showing that this occurs if and only if the group is cyclic of odd prime power…

The power graph $P(G)$ of a group $G$ is a simple graph with the vertex set $G$ such that two distinct vertices $u,v \in G$ are adjacent in $P(G)$ if and only if $u^m = v$ or $v^m = u$, for some $m \in \mathbb{N}$. The purpose of this paper…

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

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…

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set…

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…

Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…

We consider a method popular in the literature of associating a two-step nilpotent Lie algebra with a finite simple graph. We prove that the two-step nilpotent Lie algebras associated with two graphs are Lie isomorphic if and only if the…