Related papers: The commuting graph of a soluble group

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

The paper is devoted to studying the orthogonality graph of the matrix ring over a commutative ring. It is proved that the orthogonality graph of the ring of matrices with size greater than 1 over a commutative ring with zero-divisors is…

Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(S)$, is the graph whose vertices are the non-central elements of $S$ and whose edges are the sets $\{a,b\}$ of vertices such that $a\ne b$ and $ab=ba$.…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

Let $A$ be a finite group acting by automorphisms on the finite group $G$. We introduce the commuting graph $\Gamma (G,A)$ of this action and study some questions related to the structure of $G$ under certain graph theoretical conditions on…

In a recent paper C. Miguel proved that the diameter of the commuting graph of the matrix ring $\mathrm{M}_n(\mathbb{R})$ is equal to $4$ either if $n=3$ or $n>4$. But the case $n=4$ remained open, since the diameter could be $4$ or $5$. In…

We review the nearly complete classification project for finite distance-transitive graphs and compile a list of all known graphs. Interestingly, we find that those graphs with diameter larger than 4, apart from a small finite number of…

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…

Given a finite group $G$, the difference graph of $G$, denoted by $\mathcal{D}(G)$, is the difference of the enhanced power graph of $G$ and the power graph of $G$, with all isolated vertices removed. This paper mainly studies the…

We show that any infinite ring has an infinite nonunital compressed commuting graph. We classify all infinite unital rings with finite unital compressed commuting graph, using semidirect product of rings as our main tool. As a consequence…

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $\Gamma_G$ associated to $G$ is the graph whose vertex set is $G\setminus Z(G)$ and two distinct elements $x,y$ are adjacent if and only if $xy\neq yx$.…

Let $G$ be a finite group. For $x \in G$, we define the solvabilizer of $x$ in $G$, denoted $sol_G(x)$, to be the set $\{g \in G \mid \langle g,x \rangle$ is solvable$\}$. A group $G$ is an S-group if $sol_G(x)$ is a subgroup of $G$ for…

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.

Let G be a non-abelian group and let Z(G) be the center of G. Associate a graph {\Gamma}G (called non-commuting graph of G) as follows: Take G\Z(G) as the vertices of {\Gamma}G and join x and y, whenever $xy \not= yx$. In this paper, we…

This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two…

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…

A graph on $2k$ vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of length at most 3. In this paper we present an…

In this paper, we classify all the finite groups $G$ such that the commuting graph $\Gamma_C(G)$, order-sum graph $\Gamma_{OS}(G)$ and non-inverse graph $\Gamma_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite…