Related papers: On Finite groups whose power graphs are line graph…

In this paper we classify the finite groups satisfying the following property $P_4$: their orders of representatives are set-wise relatively prime for any 4 distinct non-central conjugacy classes.

The reduced power graph $\mathcal{RP}(G)$ of a group $G$ is the graph with vertex set $G$ and two vertices $u$ and $v$ are adjacent if and only if $\left\langle v\right\rangle \subset \left\langle u \right\rangle $ or $\left\langle…

We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…

This survey describes some recent work, by the authors and others, on the existence of algebraic fibrations of group extensions, as well as the finiteness properties of their algebraic fibers, in the realm of both abstract and pro-$p$…

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

Let G be a finite group with identity e and H \neq \{e\} be a subgroup of G. The generalized non-coprime graph GAmma_{G,H} of G with respect to H is the simple undirected graph with G - \{e \}\) as the vertex set and two distinct vertices a…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

We develop a general approach to the study of maximal nilpotent subsemigroups of finite semigroups. This approach can be used to recover many known classifications of maximal nilpotent subsemigroups, in particular, for the symmetric inverse…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

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…

Let $P_0(A_n), \widetilde{P}_0(A_n), P_0(\mathcal{T}(A_n))$ and $\mathcal{O}_0(A_n)$ be respectively the proper power graph, the proper quotient power graph, the proper power type graph and the proper order graph of the alternating group…

Given a prime power $p^d$ with $p$ a prime and $d$ a positive integer, we classify the finite groups $G$ with $p^{2d}$ dividing $|G|$ in which all subgroups of order $p^d$ are complemented and the finite groups $G$ having a normal…

We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…

In this paper we give a complete algebraic description of groups elementarily equivalent to a given free nilpotent group of finite rank.

If A is a finite dimensional nilpotent associative algebra over a finite field k, the set G=1+A of all formal expressions of the form 1+a, where a is an element of A, has a natural group structure, given by (1+a)(1+b)=1+(a+b+ab). A finite…

A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…