The commuting graph $Δ(G)$ of a finite non-abelian group $G$ is a simple graph with vertex set $G$ and two distinct vertices $x, y$ are adjacent if $xy = yx$. In this paper, among some properties of $Δ(G)$, we investigate $Δ(SD_{8n})$ the commuting graph of the semidihedral group $SD_{8n}$. In this connection, we discuss various graph invariants of $Δ(SD_{8n})$ including minimum degree, vertex connectivity, independence number, matching number and detour properties. We also obtain the Laplacian spectrum, metric dimension and resolving polynomial of $Δ(SD_{8n})$.
The enhanced power graph of a group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if they belong to same cyclic subgroup. In this paper, we study distant properties and detour distant properties such as closure, interior, distance degree sequence and eccentric subgraph of the enhanced power graph of semidihedral group. Consequently, we obtained the metric dimension and resolving polynomial of the enhanced power graph of semidihedral group. At the final part of this paper, we obtained the Laplacian spectrum of the enhanced power graph of semidihedral, dihedr…
The purpose of this note is to define a graph whose vertex set is a finite group $G$, whose edge set is contained in that of the commuting graph of $G$ and contains the enhanced power graph of $G$. We call this graph the deep commuting graph of $G$. Two elements of $G$ are joined in the deep commuting graph if and only if their inverse images in every central extension of $G$ commute. We give conditions for the graph to be equal to either of the enhanced power graph and the commuting graph, and show that the automorphism group of $G$ acts as automorphisms of the deep commuting graph.
For a nonabelian group G, the non-commuting graph $Γ_G$ of $G$ is defined as the graph with vertex set $G-Z(G)$, where $Z(G)$ is the center of $G$, and two distinct vertices of $Γ_G$ are adjacent if they do not commute in $G$. In this paper, we investigate the detour index, eccentric connectivity and total eccentricity polynomials of non-commuting graph on $D_{2n}$. We also find the mean distance of non-commuting graph on $D_{2n}$.
We study the commuting graph on elements of odd prime order in finite simple groups. The results are used in a forthcoming paper describing the structure of Bruck loops and Bol loops of exponent 2.
The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is conjectured by Jafarzadeh and Iranmanesh that there is a universal upper bound on the diameter of the commuting graphs of finite groups when the commuting graph is connected. In this paper we determine upper bounds on the diameter of the commuting graph for some classes of groups to rule them out as possible counterexamples to this conjecture. We also give an example of an infinite family of groups with tr…
In this work we discuss whether the non-commuting graph of a finite group can determine its nilpotency. More precisely, Abdollahi, Akbari and Maimani conjectured that if $G$ and $H$ are finite groups with isomorphic non-commuting graphs and $G$ is nilpotent, then $H$ must be nilpotent as well (Conjecture 2). We pose a new conjecture (Conjecture 3) that, together with the assumption $|Z(G)|\geq|Z(H)|$, implies Conjecture 2 and we prove it for groups in which all centralizers of non-central elements are abelian.
In this paper, we determine the diameter of the commuting involution graphs of special and general linear groups over an arbitrary field. It turns out that our results also determine the diameter for certain projective special linear groups over finite fields. Moreover, we find the diameter of the commuting graphs of general linear groups on the set of all involutions over a field of characteristic 2, which completes the diameter of general linear groups on the set of all involutions. As an application, we classify the structure of the four-dimensional linear groups over finite fields accordin…
The enhanced power graph $\mathcal{P}_e(G)$ of a group $G$ is a graph with vertex set $G$ and two vertices are adjacent if they belong to the same cyclic subgroup. In this paper, we consider the minimum degree, independence number and matching number of enhanced power graphs of finite groups. We first study these graph invariants for $\mathcal{P}_e(G)$ when $G$ is any finite group, and then determine them when $G$ is a finite abelian $p$-group, $U_{6n} = \langle a, b : a^{2n} = b^3 = e, ba =ab^{-1} \rangle$, the dihedral group $D_{2n}$, or the semidihedral group $SD_{8n}$. If $G$ is any of the…
Let $G$ be a non-abelian group and $Z(G)$ be its center. The non-commuting graph $\mathcal{A}_G$ of $G$ is the graph whose vertex set is $G\backslash Z(G)$ and two vertices are joined by an edge if they do not commute. Let $\mathrm{SL}(2,q)$ be the special linear group of degree 2 over the finite field of order $q$. In this paper we prove that if $G$ is a group such that $\mathcal{A}_G\cong \mathcal{A}_{\mathrm{SL}(2,q)}$ for some prime power $q\geq 2$, then $G\cong \mathrm{SL}(2,q)$.
The commuting graph of a group G, denoted by Gamma(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Z_m be the commutative ring of equivalence classes of integers modulo m. In this paper we investigate the connectivity and diameters of the commuting graphs of GL(n,Z_m) to contribute to the conjecture that there is a universal upper bound on diam(Gamma(G)) for any finite group G when Gamma(G) is connected. For any composite m, it is shown that Gamma(GL(n,Z_m)) and Gamma(M(n,Z_m)) are conne…
The commuting graph of a finite non-commutative semigroup $S$, denoted $\cg(S)$, is a simple graph whose vertices are the non-central elements of $S$ and two distinct vertices $x,y$ are adjacent if $xy=yx$. Let $\mi(X)$ be the symmetric inverse semigroup of partial injective transformations on a finite set $X$. The semigroup $\mi(X)$ has the symmetric group $\sym(X)$ of permutations on $X$ as its group of units. In 1989, Burns and Goldsmith determined the clique number of the commuting graph of $\sym(X)$. In 2008, Iranmanesh and Jafarzadeh found an upper bound of the diameter of $\cg(\sym(X))$…
We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph of some semigroup. Moreover, we obtain a complete classification of the graphs with an isolated vertex or edge that are the commuting graph of a group and the cycles that are the commuting graph of a centrefree semigroup.
In this paper, we initiate the study of spectrum of the commuting graphs of finite non-abelian groups. We first compute the spectrum of this graph for several classes of finite groups, in particular AC-groups. We show that the commuting graphs of finite non-abelian AC-groups are integral. We also show that the commuting graph of a finite non-abelian group $G$ is integral if $G$ is not isomorphic to the symmetric group of degree $4$ and the commuting graph of $G$ is planar. Further it is shown that the commuting graph of $G$ is integral if the commuting graph of $G$ is toroidal.
The commuting graph of a finite soluble group with trivial centre is investigated. It is shown that the diameter of such a graph is at most 8 or the graph is disconnected. Examples of soluble groups with trivial centre and commuting graph of diameter 8 are provided.
The commuting graph of a finite group with trivial centre is examined. It is shown that the connected components of the commuting graph have diameter at most 10.
In this paper, we compute the Laplacian spectrum of non-commuting graphs of some classes of finite non-abelian groups. Our computations reveal that the non-commuting graphs of all the groups considered in this paper are L-integral. We also obtain some conditions on a group $G$ so that its non-commuting graph is L-integral.
The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism) all finite non-abelian groups whose commuting graphs are acyclic, planar or toroidal. We also derive explicit formulas for the genus of the commuting graphs of some well-known class of finite non-abelian groups, and show that, every collection of finite non-abelian groups whose commuting graphs have the same genus is finite.
In this article we consider commuting graphs of involution conjugacy classes in the affine Weyl group of type $\tilde C_n$. We show that where the graph is connected the diameter is at most $n+2$.
A finite non-abelian group $G$ is called commuting integral if the commuting graph of $G$ is integral. In this paper, we show that a finite group is commuting integral if its central factor is isomorphic to ${\mathbb{Z}}_p \times {\mathbb{Z}}_p$ or $D_{2m}$, where $p$ is any prime integer and $D_{2m}$ is the dihedral group of order $2m$.
Let $A$ be a finite group acting by automorphisms on the finite group $G$. We introduce the commuting graph $Γ(G,A)$ of this action and study some questions related to the structure of $G$ under certain graph theoretical conditions on $Γ(G,A)$.
Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $Γ_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$. We prove that if $G$ and $H$ are non-abelian nilpotent groups with irregular isomorphic non-commuting graphs, then $|G|=|H|$.
Let G be a non-abelian group and Z(G) be the center of G. The non-commuting graph Γ(G) of G is a graph with vertex set is non central elements of G and two vertices x, y are adjacent if and only if they are commute. In this paper we calculate the energy, Laplacian energy and spectrum of non-commuting graph of dihedral group D2n. Also we will obtain the energy of non-commuting graph of D2n \times D2n and G \times H, where G is a non-abelian finite group and H is an abelian finite group
Let $G$ be a group and $Z(G)$ be its center. We associate a commuting graph $Γ(G)$, whose vertex set is $G\setminus Z(G)$ and two distinct vertices are adjacent if they commute. We say that $Γ(G)$ is strong $k$ star free if the $k$ star graph is not a subgraph of $Γ(G)$. In this paper, we characterize all strong $5$ star free commuting graphs. As a byproduct, we classify all strong claw-free graphs. Also, we prove that the set of all non-abelian groups whose commuting graph is strong $k$ star free is finite.
Commuting involution graphs have been studied for finite Coxeter groups and for affine groups of classical type. The purpose of this short note is to establish some general results for commuting involution graphs in affine Coxeter groups, and to deal with types $\tilde F_4$ and $\tilde G_2$. Types $\tilde E_6$ $\tilde E_7$ and $\tilde E_8$ are more substantial and we will address these in a forthcoming paper.
In this paper we compute spectrum, Laplacian spectrum, signless Laplacian spectrum and their corresponding energies of commuting conjugacy class graph of the group $G(p, m, n) = \langle x, y : x^{p^m} = y^{p^n} = [x, y]^p = 1, [x, [x, y]] = [y, [x, y]] = 1\rangle$, where $p$ is any prime, $m \geq 1$ and $n \geq 1$. We derive some consequences along with the fact that commuting conjugacy class graph of $G(p, m, n)$ is super integral. We also compare various energies and determine whether commuting conjugacy class graph of $G(p, m, n)$ is hyperenergetic, L-hyperenergetic or Q-hyperenergetic.
Morgan and Parker have proved that if $G$ is a group satisfying the condition that $Z(G) = 1$, then the connected components of the commuting graph of $G$ have diameter at most $10$. Parker has proved that if in addition $G$ is solvable, then the commuting graph of $G$ is disconnected if and only if $G$ is a Frobenius group or a $2$-Frobenius group, and if the commuting graph of $G$ is connected, then its diameter is at most $8$. We prove that the hypothesis $Z (G) = 1$ in these results can be replaced with $G' \cap Z(G) = 1$. We also prove that if $G$ is solvable and $G/Z(G)$ is either a Frob…
In this paper we compute common neighbourhood (abbreviated as CN) spectrum and energy of commuting conjugacy class graph of several families of finite non-abelian groups. As a consequence of our results we show that the commuting conjugacy class graphs of the groups $D_{2n}$, $T_{4n}$, $SD_{8n}$, $U_{(n,m)}$, $U_{6n}$, $V_{8n}$, $G(p, m, n)$ and some families of groups whose central quotient is isomorphic to $D_{2n}$ or $Z_p \times Z_p$, for some prime $p$, are CN-integral but not CN-hyperenergetic.
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$. Denote by $T(X)$ the semigroup of full transformations on a finite set $X$. Let $J$ be any ideal of $T(X)$ such that $J$ is different from the ideal of constant transformations on $X$. We prove that if $|X|\geq4$, then, with a few exceptions, the diameter of $\cg(J)$ is 5. On the other hand, we prove that for every positive integer $n$, there exists a semigr…
In this paper we investigate commuting involution graphs in classical affine Weyl groups. Let $W$ be a classical Weyl group of rank $n$, with $\tilde W$ its corresponding affine Weyl group. Our main result is that if $X$ is a conjugacy class of involutions in $\tilde W$, then the commuting involution graph $\mathcal{C}(\tilde W, X)$ is either disconnected or has diameter at most $n+2$. This bound is known to hold for types $\tilde A_n$ and $\tilde C_n$, so the main work of this paper is to prove the theorem for types $\tilde B_n$ and $\tilde D_n$.
In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this problem. We make some general observations on this problem, and obtain a polynomial-time algorithm for the case of extraspecial groups.
The commuting graph of a finite non-commutative semigroup S, denoted by Δ(S), is the simple graph whose vertices are the non-central elements of S and two distinct vertices x; y are adjacent if xy = yx. In the present paper, we study various graph-theoretic properties of the commuting graph Δ(B_n) of Brandt semigroup B_n including its diameter, clique number, chromatic number, independence number, strong metric dimension and dominance number. Moreover, we obtain the automorphism group Aut(Δ(Bn)) and the endomorphism monoid End(Δ(Bn)) of Δ(Bn). We show that Aut(Δ(Bn)) = S_n \times Z_2, where S_…
Let $G$ be a non-abelian group. The non-commuting graph $\mathcal{A}_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joint if and only if they do not commute. In a finite simple graph $Γ$ the maximum size of a complete subgraph of $Γ$ is called the clique number of $Γ$ and it is denoted by $ω(Γ)$. In this paper we characterize all non-solvable groups $G$ with $ω(\mathcal{A}_G)\leq 57$, where the number 57 is the clique number of the non-commuting graph of the projective special linear group $\mathrm{PSL}(2,7)$. We also complete the det…
