The energy and spectrum of non commuting graph
Sayyed Heidar Jafari, Maryam Nasiri

TL;DR
This paper investigates the spectral properties and energy of non-commuting graphs associated with dihedral groups and their products, providing explicit calculations and extending known results in algebraic graph theory.
Contribution
It computes the energy, Laplacian energy, and spectrum of non-commuting graphs for dihedral groups and their products, offering new explicit formulas and extending previous work.
Findings
Calculated the energy and spectrum of non-commuting graphs of D2n.
Extended results to non-commuting graphs of D2n × D2n and G × H.
Provided explicit formulas for energies of these graphs.
Abstract
Let G be a non-abelian group and Z(G) be the center of G. The non-commuting graph {\Gamma}(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
| groups | characteristic polynomial | eigenvalues | energy |
|---|---|---|---|
| groups | characteristic polynomial | eigenvalues | energy |
|---|---|---|---|
| 8 | |||
| 60 | |||
| 126 | |||
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Finite Group Theory Research · Graph Labeling and Dimension Problems
The energy and spectrum of non-commuting graphs
M.Nasiri 1 and S.H.Jafari 2
[email protected]](mailto:[email protected])
Department of Mathematics, Shahrood University of Technology, Shahrood, Iran, P.O. Box: 316-3619995161.
Abstract.
Let be a non-abelian group and be the center of . The non-commuting graph of is a graph with vertex set in which two vertices and are joined if and only if . In this paper we calculate the energy, Laplacian energy and spectrum of non-commuting graph of dihedral group . Also we will obtain the energy of non-commuting graph of and , where G is a non-abelian finite group and H is an abelian finite group.
Key words: Non-commuting graph, Energy of a graph , Spectrum.
2010 Mathematics Subject Classification: 20D99, 05C50.
1. Introduction and preliminaries
Let be a non-abelian finite group and be its center. The non-commuting graph of is a graph whose vertex set is and two vertices and are joined if and only if . Note that if is an abelian, then is the null graph.The non-commuting graph was first considered by Paul Erdös, when he posed the following problem in 1975 : Let be a group whose non-commuting graph has no infinite complete subgraph. Is it true that there is a finite bound on the cardinalities of complete subgraphs of ? B. H. Neumann answered positively Erdös’s question in . The adjacency matrix of graph is the matrix indexed by the vertex set of , where when there is an edge from to in and otherwise. The characteristic polynomial of , denoted by , is the polynomial defined by where denotes the identity matrix. The spectrum of a finite graph is by definition the spectrum of the adjacency matrix , that is, its set of eigenvalues together with their multiplicities. Assume that are distinct eigenvalues of with the corresponding multiplicities . We denote by
[TABLE]
Let be an undirected graph without loops. The Laplacian matrix of is the matrix indexed by the vertex set of , with zero row sums. If is the diagonal matrix, indexed by the vertex set of such that is the degree of then . The energy of a graph , denoted by , is defined as
[TABLE]
where are the eigenvalues of the adjacency matrix of . This concept was introduced by Gutman and is intensively studied in chemistry, since it can be used to approximate the total -electron energy of a molecule(see, e.g.[3,4]).
Let be a graph with vertices and edges. Let be the Laplacian eigenvalues of . The Laplacian energy of a graph , is defined as
[TABLE]
Theorem 1.1**.**
*([2,6]). Let denote the complete -partite graph,
, and . Then*
[TABLE]
The spectrum of consist of the spectral radius determined from the equation , eigenvalue [math] with multiplicity and eigenvalues situated in the intervals .
Lemma 1.2**.**
*([5]) If is the spectral redius of the complete multipartite graph , then
[TABLE]
Lemma 1.3**.**
([5]). If , then
[TABLE]
[TABLE]
* If , then*
[TABLE]
2. The energy and Laplacian energy of non-commuting graphs of some special groups
In this section, we calculate the energy and Laplacian energy of non-commuting graph of dihedral group .
Theorem 2.1**.**
If is even and , then
[TABLE]
If is odd, then
[TABLE]
If , then .
Proof.
The adjacency matrix of is equal to
[TABLE]
when n is even, and
[TABLE]
when is odd. By direct calculations
[TABLE]
This completes the proof. ∎
Corollary 2.2**.**
[TABLE]
In Table , the energies of some non-commuting graphs of dihedral groups is given.
Theorem 2.3**.**
Let , where (p is prime). Then
[TABLE]
where .
Proof.
By [1] we have
[TABLE]
such that is the subgroup of all diagonal matrices in , is a cyclic subgroup of of order and is the sylow -subgroug of contaning all matrices as . Moreover and . Also the number of conjugates of , and is equal to , and , respectively. Since for any non-central element of , and for any non-trivial element of , then the non-commuting graph of group is a complete -partite graph where
[TABLE]
By Theorem 1.1,
[TABLE]
∎
Corollary 2.4**.**
[TABLE]
where , and are roots of .
Proof.
By Theorem 2.3, we have
[TABLE]
Let , ,
and . Then we have . It is convenient to make the translation , converting into , where and . We have
[TABLE]
Since , has three real roots. Now let , and be roots of . Then
[TABLE]
∎
Theorem 2.5**.**
If is even and , then
[TABLE]
If is odd, then
[TABLE]
If , then .
Proof.
By considering and direct calculations, we have
[TABLE]
This completes the proof. ∎
Corollary 2.6**.**
[TABLE]
In Table , the Laplacian characteristic polynomial and eigenvalues of non-commuting graphs of some dihedral groups is given.
3. The energy of non-commuting graph of direct product of groups
In this section, we calculate the energy of non-commuting graph of and , which G is a non-abelian finite group and H is an abelian finite group.
Theorem 3.1**.**
Let be a non-abelian finite group and be an abelian group of order . Then
Proof.
Let be elements of . Suppose and be adjacency matrices of non-commuting graph of groups and , respectively. Then the adjacency matrix of as the following form
[TABLE]
We have
[TABLE]
But
[TABLE]
Thus
[TABLE]
If be eigenvalues of , then
[TABLE]
are eigenvalues of . Therefore
[TABLE]
∎
Lemma 3.2**.**
Let . Then
[TABLE]
and
[TABLE]
Proof.
For group , we consider the adjacency matrix similar to by adding vertices to . Adjacency matrices of and differ only in some zero rows and zero columns. We have
[TABLE]
By direct calculations
[TABLE]
Thus
[TABLE]
Now assume that
[TABLE]
By calculating
[TABLE]
According to the description of the beginning of the proof, we conclude that
[TABLE]
and
[TABLE]
∎
Theorem 3.3**.**
Let . If is even and , then
[TABLE]
*where is a polynomial of degree . Also the spectrum of is equal to
*
[TABLE]
where , , , , , , , and , , are roots of and \big{(}-x^{3}-(2n+4)x^{2}+16n(n-2)\big{)}, respectively.
Proof.
By the proof of Lemma 3.2, we have
[TABLE]
By direct calculations
[TABLE]
Thus
[TABLE]
Now assume that
[TABLE]
By direct calculations, we have
[TABLE]
[TABLE]
where , and . Therefore
[TABLE]
[TABLE]
Let
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
where is transpose of . It follows that
[TABLE]
where is a polynomial of degree . This implies that
[TABLE]
Now let , , , , , , and be roots of in . Suppose , and are roots of
\big{(}-x^{3}-(2n+4)x^{2}+16n(n-2)\big{)}. Then
[TABLE]
∎
Corollary 3.4**.**
[TABLE]
Example 3.5**.**
[TABLE]
and
[TABLE]
*where , , and , , are roots of
and , respectively. Also , , , are roots of .*
Theorem 3.6**.**
*Let be a finite non-abelian group, where . Then
[TABLE]
Proof.
By the proof of Lemma 3.2, the adjacency matrix of as following
[TABLE]
Similar to the proof of Lemma 3.2, we have
[TABLE]
∎
Theorem 3.7**.**
Let be a finite non-abelian group, where . If is even, then
[TABLE]
Proof.
By the proof of Lemma 3.2, we have
[TABLE]
By direct calculations
[TABLE]
∎
Theorem 3.8**.**
Let be a finite non-abelian group, where . Then
[TABLE]
Proof.
It is similar to the proof of Lemma 3.2. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Abdollahi, S. Akbari and H. R. Maimani, Non-commuting graph of a group, J.Algebra 298(2006),no .2,468-492.
- 2[2] D. Cvetković, M. Doob, H. Sachs, Spectra of graphs -Theory and application, Academic press, Newyork, 1980.
- 3[3] I. Gutman, O. E. Polansky, Mathematical consepts in organic chemistry, springer, Berlin, 1986.
- 4[4] I.Gutman, The energy of a graph: old and new results, in: A. Betten, A. Kohnert, R. Laue and A. Wassermann(Eds)-verlag, Berlin, 2001, pp 196-211.
- 5[5] D. Stevanovic, I. Gutman, M. U. Rehman, On spectral radius energy of complete multipartite graphs, received 18 june 2013, accepted 8 march 2014 , published online 8 august 2014.
- 6[6] C. Delorme, Eigenvalues of complete multipartite graphs, Discrete math.312(2012), 2532-2535.
- 7[7] B. H. Neumann, A problem of Paul Erdös on groups, J. Aust. Math. Soc. Ser. A 21(1976)467-472.
