1 Introduction
The study of graphs defined on groups has emerged as an important area of research. There is a rich literature exploring graphs defined on groups. Cameron’s survey [Reference Cameron3] provides a bibliography of many such papers. In particular, in [Reference Cameron3], Cameron introduced the concept of a hierarchy between graphs defined on groups and posed several related open questions. Some of these questions have been answered in [Reference Surbhi and Venkataraman9, Reference Surbhi and Venkataraman10].
We define a new graph called the symmetric normaliser graph of a finite group G. It is a graph with vertex set G, and two vertices x and y are adjacent if x lies in
$N(\langle y \rangle )$
and y lies in
$N(\langle x \rangle )$
, where
$N(H)$
denotes the normaliser of the subgroup H of G. We denote this graph by SNorm(G). The paper [Reference Delizia, Gaeta and Monetta6] independently investigates a directed graph called the directed normalising graph, which has some similarity to SNorm(G).
We will denote the power graph, the enhanced power graph and the commuting graph of a group G by Pow(G), EPow(G) and Com(G), respectively. In [Reference Cameron3], Cameron described the sequence formed by the power graph, enhanced power graph and commuting graph as a hierarchy, as the edge set of each is contained in the edge set of the next in the sequence.
In addition, we consider the nilpotent graph denoted by Nilp(G) (in which two vertices are adjacent if they generate a nilpotent subgroup). The hierarchy we can consider now is the sequence: power graph, enhanced power graph, commuting graph and nilpotent graph. We refine this for a group G with the introduction of the symmetric normaliser graph.
We also consider the Engel graph of a group denoted by Engel(G) and the nongenerating graph of a group G, denoted by NGen(G). The Engel graph was first introduced in [Reference Abdollahi1] and was modified in [Reference Cameron3]. We follow the second definition. Engel(G) has the elements of G as its vertex set, and elements x and y are adjacent if for some integer k, either
$[x ,_k y] = 1$
or
$[y ,_k x] = 1$
, where
$[x ,_k y] = [[x ,_{k-1} y],y]$
. The graph NGen(G) has G as the vertex set and two elements are adjacent if they do not generate G. For a graph
$\Gamma $
, we denote its edge set by
$E(\Gamma )$
.
Theorem 1.1. Let G be a group. Then:
-
(i) $E(\mathrm{Com}(G)) \subseteq \, E(\mathrm{SNorm}(G)) \subseteq \, E (\mathrm{Nilp}(G))$
; -
(ii) $E(\mathrm{SNorm}(G)) \subseteq \, E (\mathrm{NGen}(G))$
if G is a nonabelian simple group or not 2-generated; -
(iii) $E(\mathrm{SNorm}(G)) \subseteq \, E (\mathrm{Engel}(G))$
.
The natural question that arises is when there is equality amongst the edge sets of graphs in this hierarchy. For a finite group G to have equal power and enhanced power graph, or equal enhanced power graph and commuting graph, the necessary and sufficient conditions can be found in [Reference Cameron3]. These were extended to groups in general in [Reference Surbhi and Venkataraman10]. We have the following results in a similar vein. We need to discuss exponent-critical groups [Reference Blackburn, Cocke, Misseldine and Venkataraman2] and the definition of an SNNC-group (symmetric normaliser non-commuting group) to state our second result.
A finite group G is exponent-critical if the exponent of G is not the least common multiple of the exponents of its proper nonabelian subgroups. An exponent-critical p-group P is of type
$\mathcal {B}$
if P has more than one abelian maximal subgroup. An SNNC-group is an exponent-critical p-group of type
$\mathcal {B}$
, which is isomorphic to the quaternion group
$Q_8$
or to a group P of order
$p^n$
defined by
where
$\alpha , \beta $
are integers such that
$\alpha + \beta = n-1$
. Further,
$\alpha \geq \beta \geq 1$
except when
$p=2$
and
$\alpha = \beta $
, in which case, we have
$\alpha> 1$
.
Theorem 1.2. The commuting graph of a finite group G is equal to the symmetric normaliser graph of G if and only if G does not have a subgroup isomorphic to an
$\mathrm{SNNC}$
-group.
Finally, we have the following necessary and sufficient condition.
Theorem 1.3. The symmetric normaliser graph and the nilpotent graph of a finite group G are equal if and only if for any odd prime p, the Sylow p-subgroups are abelian and for
$p=2$
, the Sylow p-subgroups are either abelian or a direct product of the quaternion group
$Q_8$
and an elementary abelian group.
In Section 2, we prove Theorem 1.1 (= Theorem 2.1) and Theorem 1.2 (= Theorem 2.6). The last section has the proof of Theorem 1.3 (= Theorem 3.1), some concluding remarks and open questions.
2 Refined hierarchies and equalities I
It has already been stated [Reference Cameron3, Proposition 2.6] that if a finite group G is nonabelian or not 2-generated, then E(Com(G))
$\subseteq \, E$
(NGen(G)). Theorem 1.1 is a similar result for SNorm(G) and NGen(G). We restate it here for convenience.
Theorem 2.1. Let G be a group. Then:
-
(i) $E(\mathrm{Com}(G)) \subseteq \, E(\mathrm{SNorm}(G))\subseteq \, E(\mathrm{Nilp}(G))$
; -
(ii) $E(\mathrm{SNorm}(G)) \subseteq \, E(\mathrm{NGen}(G))$
if G is a nonabelian simple group or not 2-generated; -
(iii) $E(\mathrm{SNorm}(G)) \subseteq \, E(\mathrm{Engel}(G))$
.
Proof. It is clear that if an edge is present in the commuting graph, then it is present in the symmetric normaliser graph. Let x and y be adjacent in SNorm(G), and let H denote the subgroup of G generated by x and y. Since the commutator
$c = [x,y] = xyx^{-1}y^{-1}$
commutes with both x and y, the subgroup generated by c is in the centre of H. Clearly, the quotient group
${H}/{\langle c \rangle }$
is abelian and, therefore, nilpotent. Consequently, H is nilpotent.
Now, let G be a nonabelian simple group and assume that
$x,y$
are nonidentity elements. Then,
$H \leq N(\langle y \rangle ) \lneq G$
, which implies that
$x,y$
are adjacent in NGen(G). Lastly, since the commutator
$[x, y]$
commutes with both x and y, we have
$[x,_2 y ] = 1$
and
$[y ,_2 x] =1$
. Therefore, elements
$x,y$
are adjacent in the Engel graph of G.
The rest of this section is devoted to proving results that will give us the necessary and sufficient condition under which the commuting graph of a finite group is equal to the symmetric normaliser graph. We use the commutator identities
Lemma 2.2. Let G be a finite group such that the commuting graph of G is not equal to the symmetric normaliser graph of G. Then, the group G has a subgroup
$H = \langle h, k \rangle $
, which is a 2-generated p-group such that
$|H'| = p$
and
$H' \leq Z(H)$
. Further, h and k are adjacent in
$\mathrm{SNorm}(H)$
.
Proof. Let G be a finite group such that the edge set of its commuting graph is a proper subset of the edge set of its symmetric normaliser graph. This gives elements x and y, which satisfy the relations
Note that if
$x, y$
satisfy (2.2), then
$[x, y]$
commutes with both x and y. So, using (2.1a) and (2.1b), we have
$ [x^m, y]= {[x, y]}^m = [x, y^m]$
for any integer m.
Let
$\mathcal {L}$
denote the collection of all elements
$x'$
such that there exists
$y' \in G$
with
$x', y'$
satisfying (2.2). Choose h from
$\mathcal {L}$
such that
$|h|$
is the least. Define a set
$\mathcal {L}_h$
as the collection of all elements
$y"$
such that h and
$y"$
satisfy (2.2). From this set, we choose k such that
$|k|$
is the least. Let p be a prime that divides the order of h. Now,
$h^p$
lies in the normaliser of
$\langle k \rangle $
in G and k lies in the normaliser of
$\langle h^p \rangle $
in G. This implies that
$h^p$
commutes with k and so
$[h,k]^p=e$
. Similarly, if q is a prime that divides the order of k, then
$[h,k]^q=e$
, which means that p and q are equal. Thus, h and k have prime-power order for the same prime, say p. Let
$H=\langle h,k \rangle $
. Then, the subgroup H has order
$p^n$
for some natural number n, and its derived subgroup
$H' = \langle [h,k] \rangle $
has order p and
$H' \leq Z(H)$
, which makes H a
$2$
-generated nilpotent group of class 2.
Blackburn et al. [Reference Blackburn, Cocke, Misseldine and Venkataraman2] defined a new class of finite groups called exponent-critical p-groups of type
$\mathcal {B}$
. By [Reference Blackburn, Cocke, Misseldine and Venkataraman2, Theorem D], a nonabelian finite p-group has type
$\mathcal {B}$
if and only if it is 2-generated with derived subgroup of order p. This implies that if G is a finite group such that its commuting graph and symmetric normaliser graph are not equal, then G has a subgroup that is an exponent-critical p-group of type
$\mathcal {B}$
.
A parameter-based list of isomorphism classes of exponent-critical p-groups of type
$\mathcal {B}$
was given in [Reference Blackburn, Cocke, Misseldine and Venkataraman2, Theorem 4.2]; we reproduce it as the following lemma.
Lemma 2.3. Let P be an exponent-critical finite nonabelian p-group of type
$\mathcal {B}$
of order
$p^n$
. Then,
where
$\alpha , \beta , \rho , \sigma $
are integers such that
$ \alpha \geq \beta \geq 1, \alpha + \beta = n-1$
and
$ 0 \leq \rho , \sigma \leq 1 $
. When p is odd, P is isomorphic to exactly one of the groups whose parameters
$(\alpha , \beta , \rho , \sigma )$
are listed below:
-
A1.
-
(a) $(\alpha , \beta , 0, 1)$
with
$\alpha> \beta \geq 1$
; -
(b) $(\alpha , \beta , 1, 1)$
with
$\alpha> \beta \geq 1$
; -
(c) $(\alpha , \beta , 1, 0)$
with
$\alpha> \beta \geq 1$
;
-
-
A2.
-
(a) $(\alpha , \alpha , 0, 1)$
with
$\alpha \geq 1$
; -
(b) $(\alpha , \alpha , 1, 1)$
with
$\alpha \geq 1$
.
-
When
$p=2$
, P is isomorphic to exactly one of the groups whose parameters
$(\alpha , \beta , \rho , \sigma )$
are listed below:
-
B1.
-
(a) $(\alpha , \beta , 0, 1)$
with
$\alpha> \beta \geq 1$
; -
(b) $(\alpha , \beta , 1, 1)$
with
$\alpha> \beta \geq 1$
; -
(c) $(\alpha , \beta , 1, 0)$
with
$\alpha> \beta \geq 1$
;
-
-
B2.
-
(a) $(\alpha , \alpha , 0, 1)$
with
$\alpha> 1$
; -
(b) $(\alpha , \alpha , 1, 1)$
with
$\alpha> 1$
;
-
-
B3.
-
(a) $(1,1,0,0)$
; -
(b) $(1,1,1,1)$
.
-
In [Reference Blackburn, Cocke, Misseldine and Venkataraman2], it is shown that each element of P can be written uniquely as
$a^ib^j [a, b]^k$
, where
$ 0 \leq i < p^{\alpha }, 0 \leq j < p^{\beta }, 0 \leq k <p$
. It is also shown that
$P' = \langle [a, b] \rangle \leq Z(P)$
. This makes P nilpotent of class 2. Also, exp(P), the exponent of P, is equal to max(
$|a|,|b|$
) except when
$p=2$
and
$(\alpha , \beta , \rho , \sigma )=(1,1,1,1)$
, and then exp(P) =
$2^2=4$
.
From the list in Lemma 2.3, we identify the groups that do not have elements
$x, y$
that generate P and are also adjacent in SNorm(P). This is the main thrust of our next result. Note that in a nilpotent group of class at most 2, for any positive integer i,
Lemma 2.4. If P is an exponent-critical group of type
$\mathcal {B}$
of order
$p^n$
with parameters as in Lemma 2.3, cases A1(b), B1(b); A1(c), B1(c); A2(b), B2(b); B3(b), then there do not exist elements
$x,y \in P$
such that
$P= \langle x,y \rangle $
and
$x,y$
are adjacent in
$\mathrm{SNorm}(P)$
.
Proof. Consider the parameters in cases A1(b) and B1(b). Then,
$\sigma = 1$
and
$\rho = 1$
. Let
$x=a^ib^j[a,b]^k$
and
$y=a^rb^s[a,b]^t$
be two distinct elements of P such that they are adjacent in SNorm(P). We shall prove that they commute with each other, so they cannot generate the nonabelian group P. It follows by induction on m that
The elements x and y are adjacent in SNorm(P), so there must exist integers d and e such that
Substituting values of
$x,y$
and using
$b^lab^{-l} = a[b,a]^l$
gives
Equating (2.5) and (2.4) for
$m=e$
, we get
$re \equiv r \mbox { mod } p^{\alpha }$
. If p does not divide r, we get
$y^e=y$
and so
$xyx^{-1}=y$
. Similarly, if p does not divide i, we have
$x^d=x$
and so
${yxy^{-1}~=x}$
. If p divides both r and i, then p divides
$rj-si$
and
$[x,y] = [b,a]^{rj-si} =~1$
. Hence, x and y generate an abelian subgroup of P whenever they are adjacent in SNorm(P).
For cases A1(c) and B1(c), we have
$\rho = 1$
and
$\sigma = 0$
. Let
$x,y \in P$
. Then, there exist unique
$i,j,r,s$
satisfying
$1 \leq i,r \leq p^{\alpha }$
and
$1 \leq j,s \leq p^{\beta + 1}$
such that
$x=a^ib^j$
and
$y=a^rb^s$
. Let
$x,y$
be adjacent in SNorm(P). We shall prove that they commute with each other. Since x and y are adjacent in SNorm(P), there must exist integers d and e such that
Proceeding as in the previous case, we get
$xy=yx$
.
Lastly, we consider cases A2(c), B2(c) and B3(b). In these cases, we have
$(\alpha , \beta , \rho , \sigma ) = (\alpha , \alpha , 1, 1)$
with
$\alpha \geq 1$
. If x and y are adjacent in SNorm(P), then
$|\langle x,y \rangle | =~{|x||y|}/{|\langle x \rangle \cap \langle y \rangle |} \leq p^{2\alpha } = p^{n-1} < |P|$
.
This leaves us with the cases when
$\rho =0, \sigma =1$
for any prime p and
$(\alpha , \beta , \rho , \sigma ) =~(1, 1, 0, 0)$
when
$p=2$
. These are the cases A1(a), A2(a), B1(a), B2(a) and B3(a) of Lemma 2.3. The parameters in these cases are precisely those used to define the SNNC-groups in the introduction.
Lemma 2.5. Let P be an exponent-critical nonabelian p-group of type
$\mathcal {B}$
of order
$p^n$
. Then, the group P has elements
$x,y$
that generate P and are adjacent in
$\mathrm{SNorm}(P)$
if and only if P is an
$\mathrm{SNNC}$
-group.
Proof. We will prove this result by showing the existence of x and y, which satisfy the conditions in each of the SNNC-groups.
In case B3(a), when
$(\alpha , \beta , \rho , \sigma ) = (1, 1, 0, 0)$
, the group P is isomorphic to the quaternion group
$Q_8$
. The symmetric normaliser graph of
$Q_8$
is a complete graph. So,
$Q_8$
has 2 elements that generate it and are also adjacent in SNorm(
$Q_8$
).
For the parameters that do not give
$Q_8$
, the proof is as follows. We have
$ [a,b] = a^{p^\alpha }$
, which gives us
$ba^{-1}b^{-1}=a^{p^{\alpha }-1}$
. Thus,
Since
$\langle a \rangle $
is normal in P, we have
$ab \in N(\langle a \rangle )$
. We claim that
$a \in N(\langle ab \rangle )$
. Substituting
$i=1+p^{\alpha }$
in (2.3),
This gives x and y that generate P and are adjacent in SNorm(P).
Theorem 1.2 follows from Lemmas 2.2, 2.3, 2.4 and 2.5, as we now show. We first restate Theorem 1.2 for convenience.
Theorem 2.6. Let G be a finite group. The commuting graph of G is equal to the symmetric normaliser graph of G if and only if G does not have a subgroup isomorphic to an
$\mathrm{SNNC}$
-group.
Proof. Let G be a finite group such that the two graphs of G are unequal. By Lemma 2.2, the group G has a subgroup
$H = \langle h, k \rangle $
, which is a 2-generated p-group such that
$|H'| =p$
and
$H' = Z(H)$
. Further,
$h, k$
are adjacent in SNorm(H). By [Reference Blackburn, Cocke, Misseldine and Venkataraman2, Theorem D], the subgroup H is an exponent-critical group of type
$\mathcal {B}$
. By Lemma 2.3, the subgroup H is isomorphic to one of the groups whose parameters are mentioned in the list. Since the subgroup H has elements h and k that generate it and are adjacent in its symmetric normaliser graph, by Lemma 2.4 and Lemma 2.5, the subgroup H must be an SNNC-group.
Conversely, if a finite group G has a subgroup isomorphic to an SNNC-group, then G will have elements that satisfy (2.2), which means that the commuting graph of G is not equal to the symmetric graph of G.
3 Hierarchies and equalities II
Before proving Theorem 1.3, we remark that the symmetric normaliser graph is complete if and only if the group is a Dedekind group. This is true because every subgroup of G is normal in G if and only if
$\langle x \rangle $
is normal in G for each
$x \in G$
. This also follows from [Reference Delizia, Gaeta and Monetta6, Theorem 4.1] for a directed normalising graph of a group. The vertices of this graph are the elements of the group and there is a directed edge from a vertex x to a vertex y if the subgroup
$\langle x \rangle $
is normal in the subgroup
$\langle x,y \rangle $
. If x and y are adjacent in SNorm(G), then there is a directed edge from x to y and y to x in the directed normalising graph of G. We now restate Theorem 1.3.
Theorem 3.1. The symmetric normaliser graph and the nilpotent graph of a finite group G are equal if and only if for an odd prime p, the Sylow p-subgroups are abelian, and for
$p=2$
, the Sylow p-subgroups are either abelian or a direct product of
$Q_8$
and an elementary abelian
$2$
-group.
Proof. Let G be a finite group such that the symmetric normaliser graph and the nilpotent graph of G are equal. Let P denote a Sylow p-subgroup of G. Since the nilpotent graph of P is complete, the symmetric normaliser graph of P is also complete, which makes the subgroup P a Dedekind group. By [Reference Robinson8, Theorem 5.3.7], a group is Dedekind if and only if it is either abelian or the direct product of a quaternion group of order 8, an elementary abelian 2-group and an abelian group with all its elements of odd order. Thus, for odd primes p, the Sylow p-subgroups are abelian, and the Sylow
$2$
-subgroups of G are either abelian or a direct product of
$Q_8$
and an elementary abelian
$2$
-group.
Conversely, for the finite group G and for an odd prime p, let the Sylow p-subgroups be abelian and for
$p=2$
, let the Sylow
$2$
-subgroups either be abelian or a direct product of
$Q_8$
and an elementary abelian
$2$
-group. Let x and y be adjacent in Nilp(G). Since
$H=\langle x,y \rangle $
is a subgroup of G, for an odd prime p, the Sylow p-subgroups of H are abelian and for
$p=2$
, the Sylow
$2$
-subgroups of H are either abelian or a direct product of
$Q_8$
and an elementary abelian
$2$
-group. Since H is nilpotent, it is a direct product of its Sylow subgroups. By [Reference Robinson8, Theorem 5.3.7], the subgroup H is a Dedekind group and its symmetric normaliser graph is complete. Thus, x and y are adjacent in SNorm(G).
The proof of Theorem 1.3 shows that for a finite group G, its symmetric normaliser graph and nilpotent graph are the same if and only if the Sylow subgroups of G are Dedekind groups.
There are necessary and sufficient conditions mentioned in [Reference Cameron3] for a finite group to have equal power graph and enhanced power graph, or equal enhanced power graph and commuting graph. Using these conditions, we deduce the following result.
Theorem 3.2. Let G be a finite group. The enhanced power graph and the symmetric normaliser graph of G are equal if and only if the Sylow p-subgroups of G are cyclic.
Proof. Let G be a finite group such that its enhanced power graph and symmetric normaliser graphs are the same. This implies that EPow(G) = Com(G) = SNorm(G). By [Reference Cameron3, Proposition 3.2], Sylow p-subgroups of G are cyclic or generalised quaternion groups. Since the quaternion group is an SNNC group, by Theorem 2.6, the Sylow p-subgroups of G must be cyclic. Conversely, if the Sylow p-subgroups of G are cyclic, then G does not have a subgroup that is an SNNC group. Thus, Com(G) = SNorm(G) and, by [Reference Cameron3, Proposition 3.2], EPow(G) = Com(G).
We present some concluding remarks related to other equalities in the hierarchy of graphs defined on groups. Let G be a finite group.
(a) From [Reference Cameron3, Proposition 3.2] and Theorem 3.2, Pow(G) = SNorm(G) if and only if the Sylow p-subgroups of G are cyclic, and elements of G whose orders are coprime do not commute. Such a group G can only have elements of prime power order, that is, G is an EPPO group first studied by Higman in [Reference Higman7]. To restate, Pow(G) = SNorm(G) if and only if G is an EPPO group with cyclic Sylow subgroups. So, G is solvable and has at most two distinct primes dividing its order (see [Reference Cameron and Maslova5, Lemma 6.3]). All EPPO groups are also listed in [Reference Cameron and Maslova5]. From this, Pow(G) = SNorm(G) if and only if G is a cyclic p-group or
$|G|=p^{\alpha }q^{\beta }$
, where
$p, q$
are distinct primes and G is a Frobenius or
$2$
-Frobenius group with cyclic Sylow subgroups.
(b) The deep commuting graph (DCom(G)) of a finite group G was introduced in [Reference Cameron and Kuzma4]. Two elements of G are adjacent in DCom(G) if and only if their preimages in every central extension of G commute. Since E(DCom(G))
$\subseteq \, E$
(Com(G)), from Theorem 1.2 and [Reference Cameron3, Proposition 3.3(b)], we have a necessary and sufficient condition for DCom(G) and SNorm(G) to be equal.
(c) If G is not
$2$
-generated, then NGen(G) is complete. So, SNorm(G) = NGen(G) if and only if SNorm(G) is complete, that is, if and only if G is a Dedekind group.
We end with some open questions.
Question 3.3. What are the finite groups G of order
$p^{\alpha }q^{\beta }$
for distinct primes
$p,q$
that are Frobenius or
$2$
-Frobenius and have cyclic Sylow subgroups? If such a G is Frobenius, it will be a semidirect product of a Frobenius kernel K isomorphic to
${\mathbb {Z}_{p^{\alpha }}}$
and a Frobenius complement H isomorphic to
${\mathbb {Z}_{q^{\beta }}}$
.
Question 3.4. Let G be a nonabelian simple group. When does SNorm(G) = NGen(G)? Or is it always the case that SNorm(G)
$\subsetneq $
NGen(G)? From [Reference Cameron3, Proposition 3.1(c)], for any group H, we have NGen(H) = Com(H) if and only if H is abelian and not
$2$
-generated or a minimal nonabelian group. Since a minimal nonabelian group is always solvable, we see that for a finite nonabelian simple group G, we always have E(Com(G))
$\subsetneq \, E$
(NGen(G)). Also, any SNNC-group P for an odd prime p is always contained in an
$A_n$
for all sufficiently large n. This gives E(Com(G))
$\subsetneq \, E$
(SNorm(G)) when
$G = A_n$
for all n suitably large.
Question 3.5. What are the necessary and sufficient conditions for SNormG to be equal to Engel(G)? If G is a Dedekind group, then SNorm(G) = Nilp(G) = Engel(G), as all are complete graphs. However, we know that if the Sylow subgroups of G are Dedekind, then SNorm(G) = Nilp(G).
Question 3.6. Let G be a non-Dedekind finite group whose Sylow subgroups are Dedekind. Is E(Nilp(G))
$\subsetneq \, E$
(Engel(G))? Note that for
$G = S_3$
, we have E(Pow(G)) = E(EPow(G)) = E(Com(G)) = E(SNorm(G)) = E(Nilp(G))
$\subsetneq \, E$
(Engel(G)).


