Related papers: Characterizing finite groups whose order supergrap…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than $1$ to exactly one vertex of $C$. A subset $C$ of a group $G$ is called a perfect code of $G$ if…

Let $G$ be a finite group, $L_1(G)$ be its poset of cyclic subgroups and consider the quantity $\alpha(G)=\frac{|L_1(G)|}{|G|}$. The aim of this paper is to study the class $\cal{C}$ of finite nilpotent groups having…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

Let $\Gamma$ be a simple finite graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. Let $\mathcal{R}$ be an equivalence relation on $V(\Gamma)$. The $\mathcal{R}$-super $\Gamma$ graph $\Gamma^{\mathcal{R}}$ is a simple graph with…

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…

The power graph $\mathcal{P}(G)$ of a given finite group $G$ is the simple undirected graph whose vertices are the elements of $G$, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power…

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…

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

The superpower graph of a finite group $G$, or $\mathcal{S}_G$, is an undirected simple graph whose vertices are the elements of the group $G$, and two distinct vertices $a,b\in G$ are adjacent if and only if the order of one vertex divides…

We study groups having the property that every non-cyclic subgroup contains its centralizer. The structure of nilpotent and supersolvable groups in this class is described. We also classify finite $p$-groups and finite simple groups with…

A set S is independent in a graph G if no two vertices from S are adjacent. By core(G) we mean the intersection of all maximum independent sets. The independence number alpha(G) is the cardinality of a maximum independent set, while mu(G)…

For a finite group $G$, denote by $\alpha(G)$ the minimum number of vertices of any graph $\Gamma$ having $\text{Aut}(\Gamma)\cong G$. In this paper, we prove that $\alpha(G)\leq |G|$, with specified exceptions. The exceptions include four…

We prove various properties on the structure of groups whose power graph is chordal. Nilpotent groups with this property have been classified by Manna, Cameron and Mehatari [The Electronic Journal of Combinatorics, 2021]. Here we classify…

Let $G$ be a $2$-generated group. The generating graph $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g_1$ and $g_2$ are adjacent if $G = \langle g_1, g_2 \rangle.$ This graph encodes the…

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…