Let G be a finite group. The power graph P (G) and its main supergraph S (G) are two simple
graphs with the same vertex set G. Two elements x, y G are adjacent in the power graph if …

The power graph $\mathcal {P}(G) $ of a finite group $ G $ is the graph whose vertex set is $
G $, and two elements in $ G $ are adjacent if one of them is a power of the other. The …

A graph Г is said to be 2Гconnected if Г does not have a cut vertex. The power graph P (G) of
a group G is the graph which has the group elements as vertex set and two elements are …

We introduce a new kind of graph built from finite semigroups that we refer to as E-extended
power graphs. An E-extended power graph Γ S of a finite semigroup S can be considered as …

We investigate power graphs of quasigroups. The power graph of a quasigroup takes the
elements of the quasigroup as its vertices, and there is an edge from one element to a …

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 …

In this paper we have investigated some properties of the power graph and commuting
graph associated with a finite group, using their tree-numbers. Among other things, it has …

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 …

The power graph P (G) of a group G is the graph with vertex set G and two distinct vertices
are adjacent if one is a power of the other. Two finite groups are said to be conformal, if they …

In this talk we will investigate some properties of the power and commuting graphs
associated with finite groups, using their tree-numbers. It has been shown that the simple …