1. Introduction
Let
be a simple graph whose vertex set is
. The common neighborhood of two distinct vertices
and
, denoted by
, is the set of vertices adjacent to both
and
other than
and
. The common neighborhood matrix of
, denoted by
, is a matrix of size
n whose
th entry is 0 or
according as
or
. The common neighborhood matrix is a symmetric matrix, hence all its eigenvalues are real. The common neighborhood eigenvalues are symmetric with respect to the origin for some special class of graphs. There is a nice relation between
and
, the adjacency matrix of
. More precisely, if
then the
th entry of
is same as the
th entry of
, which is the number of 2-walks between the vertices
and
. Further, the
th entry of
is equal to the degree of
. Hence,
, where
is the degree matrix of
. Let
be the spectrum of
. Then
is the set of all the eigenvalues of
with multiplicities. If
are the distinct eigenvalues of
with multiplicities
, respectively, then we write
. The common neighborhood energy (abbreviated as CN-energy) of the graph
is given by
The study of CN-energy of graphs was introduced by Alwardi et al. in [
1]. Various properties of CN-energy of a graph can also be found in [
1,
2]. The motivation of studying
comes from the study of
, which is well-known as energy of
, a notion introduced by Gutman [
3]. Many results on
, including some bounds and chemical applications, can be found in [
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15]. It is worth recalling that
is the sum of the absolute values of the eigenvalues of the adjacency matrix of
. It is also interesting to note that
can be obtained if
is known for some classes of graphs. For instance,
and
, where
is the complete graph on
n vertices and
is the complete bipartite graph on
vertices. A graph
is called CN-hyperenergetic if
, where
. It is still an open problem to produce a CN-hyperenergetic graph or to prove the non-existence of such graph (see [
1] (Open problem 1)). In this paper we give an attempt to answer this problem by considering commuting graphs of finite groups.
The commuting graph of a finite non-abelian group
G with center
is a simple undirected graph whose vertex set is
and two vertices
x and
y are adjacent if and only if
. We write
to denote this graph. In [
16,
17,
18,
19,
20,
21,
22,
23], various aspects of
are studied. In
Section 2 of this paper, we derive an expression for computing CN-energy of a particular class of graphs and list a few already known results. In
Section 3, we compute CN-energy of commuting graph of certain metacyclic group, dihedral group (which is the group of symmetries of a regular polygon), quasidihedral group, generalized quarternion group, Hanaki group etc. We also consider some generalizations of dihedral group and generalized quarternion group. Two graphs
and
with equal number of vertices are called CN-equienergetic if
. In
Section 3, we shall also obtain some pairs of finite non-abelian groups such that their commuting graphs are CN-equienergetic. As consequences of our results, in
Section 4, we show that
for all
G considered in
Section 3 are not CN-hyperenergetic. We also identify some positive integers
n such that
is not CN-hyperenergetic if
G is an
n-centralizer group. It is worth mentioning that CN-spectrums of
for certain classes of finite groups have been computed in [
24] recently. However, the method adopted here, in computing CN-energy of
for various families of finite groups, is independent of
.
Recall that an
n-centralizer group
G is a group such that
, where
and
is the centralizer of
w (see [
25,
26]). We also identify some
such that
is not CN-hyperenergetic if
. Also recall that the commutativity degree of
G, denoted by
, is the probability that a randomly chosen pair of elements of
G commute.
Readers may review [
27,
28,
29,
30,
31,
32] for the background and various results regarding this notion. Further, we show that
is not CN-hyperenergetic if
is not planar or toroidal. Note that a graph is planar or toroidal according as its genus is zero or one respectively. Finally, we conclude the paper with a few conjectures.
3. CN-Energy of Commuting Graphs
In this section, we compute for several classes of finite non-abelian groups.
Theorem 3. Let G be a finite group with center . If is isomorphic to
- 1.
The Suzuki group , then - 2.
- 3.
The dihedral group , then
Proof. By Lemma 2 and Theorem 2 we have
Hence, the result follows on simplification. □
We have the following two corollaries of Theorem 3.
Corollary 1. Let G be isomorphic to one of the following groups
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
Then
Proof. If G is isomorphic to one of the above listed group then it is of order 16. Therefore, and so . Hence, putting in Theorem 3 (2) we get the required result. □
Corollary 2. Let G be a non-abelian group.
- 1.
If G is of order , for any prime p, then - 2.
If G is the metacyclic group , presented by , then - 3.
If G is the dihedral group , then - 4.
If G is the generalized quaternion group , presented by , then
Proof. If G is of order then and . Hence the result follows from Theorem 3 (2).
Hence, the result follows from Theorem 3 (3).
(3) Follows from part (2), considering .
(4) Follows from Theorem 3 (3), since and . □
In the following theorems we compute for more families of groups.
Theorem 4. Let G be a non-abelian group.
- 1.
If G is of order , where p and q are primes with , then - 2.
If G is the quasidihedral group , then - 3.
If then - 4.
If then
Proof. (1) If
G is of order
then, by Lemma 3 (1) and Theorem 2, we have
This gives the required result on simplification.
(2) Follows from Lemma 3 (2) and Theorem 2.
(3) By Lemma 3 (3) and Theorem 2 we have
which gives the required result.
(4) By Lemma 3 (4) and Theorem 2 we have
which gives the required result on simplification. □
Theorem 5. Let G be a non-abelian group.
- 1.
If G is the Hanaki group then - 2.
If G is the Hanaki group then
Proof. The result follows from Lemma 4 and Theorem 2. □
Note that all the groups considered above are abelian centralizer group (in short, AC-group). Now we present a result on if G is a finite AC-group.
Theorem 6. Consider that an AC-group G has distinct centralizers of non-central elements of G. Then
Proof. We have
, by [
17] (Lemma 1). Therefore, by Theorem 2, the result follows. □
Corollary 3. Let K be a finite abelian group and H be a finite non-abelian AC-group. If thenwhere . Proof. Clearly and . Hence, is an AC-group and so, by Theorem 6, the result follows. □
We shall conclude this section by obtaining some pairs of finite non-abelian groups such that their commuting graphs are CN-equienergetic.
Proposition 1. The commuting graphs of and for are CN-equienergetic.
Proof. The result follows from parts (3) and (4) of Corollary 2. □
Using Corollary 2 (parts (3) and (4)) and Theorem 4 (2) we also have the following result.
Proposition 2. The commuting graphs of , and for are pairwise CN-equienergetic.
4. Some Consequences
In this section we derive some consequences of the results obtained in
Section 3.
Theorem 7. Let G be a finite group with center . If is isomorphic to or (where p is any prime and ) then is not CN-hyperenergetic.
Proof. If
then, by Theorem 3 (1), we have
Since
, by Lemma 1 we have
Clearly, which gives .
If
then, by Theorem 3 (2), we have
Since
, by Lemma 1 we have
Thus .
If
then we have
by Theorem 3 (3). Since
, by Lemma 1 we have
Clearly . Therefore,
. This completes the proof. □
We have the following two corollaries.
Corollary 4. If G is isomorphic to one of the groups listed in Corollary 1, then is not CN-hyperenergetic.
Proof. Since is isomorphic to , the result follows from Theorem 7 considering . □
Corollary 5. Let G be a non-abelian group. If G is isomorphic to or a group of order then is not CN-hyperenergetic.
Proof. If G is isomorphic to or then is isomorphic to some dihedral groups. If G is isomorphic to a group of order then is isomorphic to . Hence, by Theorem 7, the result follows. □
We have the following results regarding commuting graphs of finite n-centralizer groups.
Theorem 8. If G is a finite 4-centralizer group then is not CN-hyperenergetic.
Proof. We have
, by [
25] (Theorem 2). Hence, using Theorem 7 for
, the result follows. □
Theorem 9. Let G be a finite -centralizer p-group. Then is not CN-hyperenergetic.
Proof. We have
, by [
33] (Lemma 2.7). Hence, by Theorem 7, the result follows. □
Theorem 10. If G is a finite 5-centralizer group then is not CN-hyperenergetic.
Proof. We have
or
, by [
25] (Theorem 4). Hence, by Theorem 7, the result follows. □
As a corollary to Theorems 8 and 10 we have the following result.
Corollary 6. Let G be a finite non-abelian group and be a set of pairwise non-commuting elements of G having maximal size. Then is not CN-hyperenergetic if .
Proof. By [
34] (Lemma 2.4), we have that
G is a 4-centralizer or a 5-centralizer group according as
or 4. Hence the result follows from Theorems 8 and 10. □
Theorem 11. Let G be a non-abelian group. If G is isomorphic to , , , , or a group of order , where p and r are primes with and , then is not CN-hyperenergetic.
Proof. If
G is isomorphic to
then, by Theorem 4, we have
Since
, by Lemma 1 we have
Clearly, . Hence, .
If
G is isomorphic to
then, by Theorem 4 (3), we have
Since
, by Lemma 1 we have
Since and we have is positive. Hence, the result follows.
If
G is isomorphic to
then, by Theorem 4 (4), we have
Since
, by Lemma 1 we have
We have , and since for some prime p. Therefore, is positive and hence the result follows.
If
G is isomorphic to
then, by Theorem 5 (1), we have
Since
, by Lemma 1 we have
Clearly, and . Therefore, .
If
then, by Theorem 5 (2), we have
Since
, by Lemma 1 we have
Hence, .
If
G is isomorphic to a non-abelian group of order
then, by Theorem 4 (1), we have
Since
, by Lemma 1 we have
Since we have . Hence, . This completes the proof. □
It is already mentioned that
, the commutativity degree of a group
G, is the probability that a randomly chosen pair of elements of
G commute. Therefore, it measures the abelianness of a group. For any finite group
G, its commutativity degree can be computed using the formula
where
is the number of conjugacy classes in
G. In finite group theory, it is an interesting problem to find all the rational numbers
such that
for some finite group
G. Over the decades, many values of such
r have obtained and characterized finite groups such that
. In the following theorem we list some values of
r such that
is not CN-hyperenergetic if
.
Theorem 12. If then is not CN-hyperenergetic.
Proof. If
then
is isomorphic to the groups in
(by [
35] (p. 246) and [
36] (p. 451)). Hence, the result follows from Theorem 7. □
Theorem 13. Let G be a finite group and , where p is the smallest prime divisor of . Then is not CN-hyperenergetic.
Proof. We have
, by [
37] (Theorem 3). Hence the result follows from Theorem 7. □
Theorem 14. If G is a finite non-solvable group and then is not CN-hyperenergetic.
Proof. We have
for some abelian group
K, by [
27] (Proposition 3.3.7). It can be seen that
. Therefore, by Theorem 2, we have
Additionally, by Lemma 1, we have
. Therefore
This completes the proof. □
The following three theorems show that is not CN-hyperenergetic if is planar/toroidal or the complement of is planar.
Theorem 15. Let G be a finite non-abelian group. If is planar then is not CN-hyperenergetic.
Proof. If , , or then, by Corollary 5, we have that is not CN-hyperenergetic.
If G is isomorphic to one of the groups listed in Corollary 1 then, by Corollary 4, it follows that is not CN-hyperenergetic. If then it can be seen that . Using Theorem 2, we have . Also, by Lemma 1, we have . Therefore, is not CN-hyperenergetic. If then . Therefore, by Theorem 7, it follows that is not CN-hyperenergetic. If then it can be seen that . Therefore, by Theorem 2, we have . Also, by Lemma 1, we have . Therefore, is not CN-hyperenergetic.
We have . Therefore, if then it follows that is not CN-hyperenergetic (follows from Theorem 11).
If
then the characteristic polynomial of
is given by
and so
Therefore,
. Additionally, by Lemma 1, we have
. Therefore,
is not CN-hyperenergetic. Hence, the result follows from [
38] (Theorem 2.2). □
Theorem 16. Let G be a finite non-abelian group. If is toroidal then is not CN-hyperenergetic.
Proof. If
or
then by Corollary 5 it follows that
is not CN-hyperenergetic. If
then, by Theorem 11, we have that
is not CN-hyperenergetic. If
G is isomorphic to
then
is not CN-hyperenergetic, follows from Theorem 11 considering
and
. If
then
. Therefore, by Theorem 7,
is not CN-hyperenergetic. If
then it can be seen that
. Therefore, by Theorem 2, we have
. Also, by Lemma 1, we have
. Hence,
is not CN-hyperenergetic. Hence, the result follows from [
39] (Theorem 6.6). □
We also have the following result.
Theorem 17. Let G be a finite non-abelian group. If the complement of is planar then is not CN-hyperenergetic.
Proof. The result follows from [
40] (Proposition 2.3) and Corollary 5. □
In view of the above results we conclude this paper with a few conjectures.
Conjecture 1. A planar or toroidal graph is not CN-hyperenergetic.
Conjecture 2. is not CN-hyperenergetic.
Conjecture 3. If , where denotes the disjoint union of copies of the complete graphs on vertices for , then it is not CN-hyperenergetic.