Abstract
Given a commutative ring R with identity , let the set denote the set of zero-divisors and let be the set of non-zero zero-divisors of R. The zero-divisor graph of R, denoted by , is a simple graph whose vertex set is and each pair of vertices in are adjacent when their product is 0. In this article, we find the structure and Laplacian spectrum of the zero-divisor graphs for , where are primes and are positive integers.
1. Introduction
All graphs considered in the present article are connected, undirected, simple and finite. A graph is denoted by , where is the vertex set and is the edge set of G. The order and the size of G are the cardinalities of and , respectively. The neighborhood of a vertex denoted by , is the set of vertices of G adjacent to v. The degree of v, denoted by , is the cardinality of . A graph G is called r-regular if degree of every vertex is r. The adjacency matrix of G is a square matrix of order n, whose -entry is 1, if and are adjacent and is 0, otherwise. Let be the diagonal matrix, where are the degrees of the vertices of G. The matrix is the Laplacian matrix and its eigenvalues with multiplicities is known as the Laplacian spectrum of G. This matrix is real symmetric and positive semi-definite matrix, so the eigenvalues can be ordered as . Also, we note that each row (column) sum is zero, so 0 is the Laplacian eigenvalue of G. Furthermore, it is well known that the Laplacian eigenvalue is positive if and only if G is connected and is known as the algebraic connectivity of More about the matrix can be seen in [1,2].
Let R be a commutative ring with non-zero identity. An element , , is known as the zero-divisor of R if we can find , , such that Beck [3] introduced the concept of the zero-divisor graphs of commutative rings and included 0 in the definition. He was mainly interested in colorings of these rings. Later Anderson and Livingston [4] modified the definition of the zero-divisor graphs by excluding 0 of the ring in the zero-divisor set and defined the edges between two non-zero zero-divisors if and only if their product is zero. The adjacency, the Laplacian, the signless Laplacian, distance Laplacian and the signless Laplacian spectral analysis can be seen in [5,6,7,8,9,10,11]. More literature about zero-divisor graphs can be seen in [4,12,13,14] and the references therein.
In G, denotes that the vertices x and y are adjacent and denotes an edge. We use the standard notation, for and respectively denote the complete graph and the complete bipartite graph. Other undefined notations and terminology can be seen in [1,15].
The remaining part of the paper is organized as follows. In Section 2, we present some preliminaries and investigate the structure of and discuss some of its graph invariants. In Section 3, we obtain the Laplacian eigenvalues of , for , where p and q are primes. We deduce several consequences from these results, which include the determination of the eigenvalues of the graphs , (zero-divisor graph of Gaussian integers modulo ), , and . At the end of the article, we give the conclusion and discussion for possible further work.
2. Structure of the Zero-Divisor Graph
We begin with the following definition.
Definition 1.
Let G be a graph of order n with vertex set and be disjoint graphs of order , The graph is formed by taking the graphs and joining each vertex of to every vertex of whenever i and j are adjacent in
This graph operation is known by different names in the literature, such as G-join, generalized composition, generalized join, joined union, and here we follow the latter name.
Let n be a positive integer and let denote the number of positive factors of n. Please note that denotes d divides n. The Euler’s totient function or Euler’s phi function, denoted by , is the number of positive integers less or equal to n and relatively prime to n. We say that n is in canonical decomposition if , where are positive integers and are distinct primes.
The following observations will be used in the sequel.
Lemma 1
([16]). If n is in canonical decomposition , then
Theorem 1
([16]). The Euler’s totient function ϕ satisfies the following.
- (i)
- ϕ is multiplicative, i.e., whenever p and q are relatively prime.
- (ii)
- (iii)
- For prime p,
For positive integer n, represents the set of congruence classes of integer modulo The ring of Gaussian integers modulon, denoted by , is represented by .
An integer d dividing n is a proper divisor of n if and only if Let be the simple graph with vertex set as the proper divisor set of n, where two vertices are adjacent provided is a multiple of n. Evidently, this graph is a connected graph [5]. If is the canonical decomposition of n, by Lemma 1, it follows that the order of is given by
For , let where is the greatest common divisor of r and We observe that , when , so, the sets are pairwise disjoint and partitions the vertex set of as From the definition of , a vertex of is adjacent [5] to the vertex of in provided that , for . The cardinality of is given as follows.
Lemma 2
([11]). For a divisor d of n, the cardinality of the set is equal to .
We note that that the induced subgraphs of are either cliques or null graphs, as can be seen below [5].
Lemma 3.
For the positive integer n and its proper , the following hold.
- (i)
- If then the subgraph of on is either the complete graph or its complement Also, is provided is a multiple of
- (ii)
- For distinct in , a vertex of is adjacent to all or none of the vertices in .
- (iii)
- For distinct in , a vertex of is adjacent to a vertex of in provided is a multiple of n.
The graph formed in part (iii) of Lemma 3 is known as graph. Clearly, can be expressed as a joined union of complete graphs and empty graphs.
Lemma 4.
[5] For the induced subgraph of on vertices for , the zero-divisor graph
For a commutative ring R with non-zero identity , and , the annihilator of a, denoted by , is the set of those elements of R that annihilates a, and we write . Define a relation on R by whenever . Obviously, and if then implying that ∼ is symmetric relation. Also, if and , then ∼ is transitive and is an equivalence relation on R which partitions R into equivalence classes. Furthermore, represents the class of , that is, .
The compressed zero-divisor graph of a commutative ring R, denoted by , is the undirected, simple graph with the vertex set = and is defined by , where and the two vertices and are adjacent provided . This graph was first defined in [17] and their properties for were investigated in [13].
For example, consider with non-zero zero-divisor set The annihilators of this set are
The compressed zero-divisor graph with the vertex set and the proper divisor graph of with the vertex set are shown in Figure 1.
Figure 1.
The Compressed zero-divisor graph, the graph and the proper divisor graph of .
In case of , we observe that the vertex sets of and are in one-one correspondence.
Proposition 1.
If is the finite commutative ring, then
Now, we find the structure of , for , where p and q, , are primes. This generalizes the results obtained in [13]. We prove the cases when and are positive even integers, and are positive odd integers and the other possible cases can be similarly proved.
Theorem 2.
Let be the zero-divisor graph of order N, where and . Then
Proof.
Let , where p and q, , are primes and and , , are positive even integers. The proper divisors of n are
By Lemma 1, order of is . From the definition of , we have
which in iteration form can be read as
Arguing as above, other adjacency relations are
For and , by Lemma 2, the cardinalities of are
Also, by Lemma 3, the induced graphs are
where we avoid corresponding to the proper divisor Lastly, by Lemma 4, the structure of the zero-divisor graph of is as in Equation (1). This completes the proof. □
In Theorem 2, taking , we have the following consequence.
Corollary 1.
If is the zero-divisor graph of order where , then
Proof.
The proper divisors of are . In , vertex is adjacent to vertex if and only if with and to avoid loops, we assume Also, n does not divide , for , so and n divides , for , and thus . Thus, Equation (3) follows. □
Another consequence gives the diameter of .
Corollary 2.
The diameter of is 3 for , and is 2 if
Proof.
In the proof of Theorem 2, we observe that if and only if , otherwise and . Lastly, . This implies that in . Similarly, from Corollary 1, distance in is at most □
The following consequence gives the clique number of
Corollary 3.
The clique number of is
Proof.
By the definition of , we can easily see that are the vertices of the clique of and the number of such vertices is
By Lemma 3, is if and only if n divides , so that the clique number of is
If , then by definition of , the vertices , form the clique in it and its size is m. Thus, the sum cardinality of the cardinalities is the clique size of . Using Lemma 1, we have
□
The following result gives the structure of , where and are both odd.
Theorem 3.
Let be the zero-divisor graph of order N where and . Then
Proof.
Let , where p and q, , are primes and and , , are positive even integers. Then the proper divisors of n are
Therefore, by the definition of , we have
By Lemma 2, for and , the cardinalities of are
Also, by Lemma 3, the induced graphs are
where we avoid corresponding to proper divisor Therefore, by Lemma 4, the structure of zero-divisor graph of is
□
If , in Theorem 3, we have the following consequence.
Corollary 4.
Let be the zero-divisor graph of order where . Then
Proof.
The proper divisors of are . In the graph , the vertex is adjacent to the vertex if and only if with and to avoid loops we assume Also, n does not divide , for , this implies that and n divides , for , so that . Now result follows. □
Other graph invariants of , like automorphism group, chromatic number, domination number, independence number, matching number can similarly be investigated.
3. Laplacian Eigenvalues of the Zero-Divisor Graph
Consider an matrix
whose rows and columns are partitioned according to a partition of the set The quotient matrix Q is a matrix of order l whose th entry is the average row sums of the blocks of M. If each block has constant row (column) sum, then the partition P is called equitable and the matrix Q is known as equitable quotient matrix. In general, the spectrum of Q is interlaced by the spectrum of M, equality holds in case of the equitable partition [1].
The following lemma gives a different method of finding determinant (det) of a matrix.
Lemma 5
([18]). Let and be respectively and matrices with and invertible. Then
where and are known as the Schur complement of and , respectively.
The following result gives the Laplacian spectrum of in terms of the Laplacian spectrum of ’s and the eigenvalues of the quotient matrix.
Theorem 4.
Let G be a graph of order n and let be regular graphs of order with Laplacian eigenvalues where . Then the Laplacian eigenvalues of are the eigenvalues for and , where is the sum of the cardinalities of the graphs , which corresponds to the neighbors of vertex and n eigenvalues of the following matrix
where for , , if , while as , if .
An equivalent statement of Theorem 4 can be seen in [19], so we omit the proof here.
Usually it is difficult to obtain the Laplacian eigenvalues of graphs in general. So, researchers attempt to get the Laplacian eigenvalues of particular class of graphs. It is important to mention that the structure of the zero-graphs associated with for has not been obtained earlier. Therefore, it becomes essential to write graphs in some known structure and obtain their Laplacian spectrum.
Now, we will find the Laplacian eigenvalues of , for , where p and q, , are primes. This generalizes the results obtained in [5] and that too by using different technique. We prove the case when and , , are positive even integers and the odd case can be similarly proved.
Theorem 5.
Let be the zero-divisor graph of order where and . The Laplacian spectrum of consists of the eigenvalues
where and The remaining Laplacian eigenvalues of are the eigenvalues of the matrix given in (6).
Proof.
By using Theorems 1 and 4, the value of ’s are
that is,
For and , we note that as vertex of are adjacent to itself, so we add and subtract cardinalities of such type of ’s so that ’s are easy to calculate. Now, as above other ’s are given by
By using Theorem 4, Equation (2) and the fact that Laplacian spectrum of is , we have
Thus, for , we see that is the Laplacian eigenvalue of with multiplicity
Now, following similar steps, it is easy to see that
are also the Laplacian eigenvalues of Again, by Equation (2), , when and and Laplacian spectrum of is , so
is the Laplacian eigenvalue of with multiplicity , where Similarly, for and , we see that and are also the Laplacian eigenvalues of with multiplicities and , respectively. The other Laplacian eigenvalues of are the zeros of the characteristic polynomial of the quotient matrix (6). □
If we put in Theorem 5, it reduces to the following result [5] with a different technique.
Corollary 5.
If for some positive integer , then the Laplacian eigenvalues of are
Proof.
Using Corollary 1, implies that . However, in general, we see that , for , where from Theorem 1, we have used . As , so we add and subtract cardinality of and thus is given as
Likewise, for , it is clear that
For , clearly are the Laplacian eigenvalue of with multiplicity . Also, from Theorem 4 and for , we see that
are also Laplacian eigenvalues of with multiplicities . The remaining Laplacian eigenvalues of are given by the following quotient matrix
where ,
Applying Lemma 5, we have
By evaluating Equation (7), we can verify that
are the remaining Laplacian eigenvalues of . We note that all the Laplacian eigenvalues of quotient matrix are repeated with the eigenvalues obtained by except □
As , so for in Corollary 5, we get the following.
Corollary 6.
The Laplacian eigenvalues of the zero-divisor graph of Gaussian integers modulo is
If and in Theorem 5, we have and its Laplacian spectrum is given by the following observation.
Corollary 7.
If , then the Laplacian spectrum of is
The following result gives the Laplacian spectrum of , when both and are odd. Its proof is similar to that of Theorem 5.
Theorem 6.
Let be the zero-divisor graph of order where and . The Laplacian spectrum of consists of the eigenvalues
where and . The remaining Laplacian eigenvalues of are the eigenvalues of the matrix given in (6).
In particular, if in Theorem 6, we have the following result of [5].
Corollary 8.
If for some positive integer , then the Laplacian spectrum of is
If , then . Therefore, by Lemmas 3 and 4, we have
The next consequence of Theorem 6 gives the Laplacian spectrum of the complete bipartite graph
Corollary 9.
The Laplacian spectrum of is
For and in Theorem 6, we have the following observation for .
Corollary 10.
If , then the Laplacian spectrum of is
Proof.
As the proper divisors of n are p and , so is . By Lemma 4, we have
That is, is a complete split graph of order , with independence number . Therefore, by Theorem 4, we have , and
.
As , so the Laplacian spectrum of consists of the eigenvalue with multiplicity , the eigenvalue with multiplicity and the other two Laplacian eigenvalues are the eigenvalues of matrix (9). □
Now, consider the case when one of ’s is even and other is odd, say is even and is odd or is odd and is even. In the following result, first case is given and the second case can be treated similarly.
Theorem 7.
Let be the zero-divisor graph of order N, where and so that . The Laplacian spectrum of consists of the eigenvalues
where and . The remaining Laplacian eigenvalues of are the eigenvalues of the matrix given in (6).
Proof.
For , with p and q, being primes and . The proper divisor set of n is
Now by the definition of , the adjacency relations are
Also, the cardinalities of ’s are
where and . Further by using Lemma 3, we have
Thus, by Lemma 4, the joined union of is
By using Theorems 1 and 4, the value of ’s are
Again, applying Theorem 4 and using Equation (10), we see that
is the Laplacian eigenvalue of with multiplicity . Similarly, the other Laplacian eigenvalues of are as in the statement. □
Next, we find the Laplacian eigenvalues of when n is the product of three primes.
Theorem 8.
The Laplacian spectrum of consists of the eigenvalues
Proof.
Let . Then and are the proper divisors of n and is the graph , and , i.e., is a unicyclic graph with pendent vertices at each vertex of cycle as shown in Figure 2. Ordering the vertices by increasing divisor sequence and applying Lemma 4, we have
Figure 2.
Proper divisor graph and zero-divisor graph .
By Theorem 4, value of ’s are
Since each of is a null graph, so the Laplacian eigenvalues of are with multiplicity , with multiplicity , with multiplicity , with multiplicity , with multiplicity , and with multiplicity . The remaining Laplacian eigenvalues of are the eigenvalues of the following matrix
□
Theorem 8 can be generalized for arbitrary product of distinct primes. Although it is hard to find the Laplacian spectra of with canonical decomposition of n, it is interesting and can explore various properties of and the structure of its associated zero-divisor graph. The spectral study of zero-divisor graphs of rings may open research work as in the case of Cayley graphs.
4. Conclusions and Comments
Let be the set of all square matrices of order n with complex entries. The trace norm of a matrix is defined as , where are the singular values of M (that is the square roots of the eigenvalues of , where is the complex conjugate of M). In case of symmetric matrices, the singular values coincide with the absolute values of the eigenvalues, i.e., if are the singular values and , are the eigenvalues of M, then . Thus, the sum of the absolute values of eigenvalues of the matrix is the trace norm of , where is the identity matrix of order n. It is an interesting problem in Matrix theory, to determine among a given class of matrices the matrix (or the matrices) which attain the maximum value and the minimum value for the trace norm. The trace norm of matrices associated with the graphs and digraphs are extensively studied. For some recent papers in this direction see [20,21] and the references therein.
In spectral graph theory, the trace norm is studied under the name graph energy. Gutman and Zhou [22] defined the Laplacian energy of G as
Using the fact that , from [23], we have
where is the number of Laplacian eigenvalues greater than or equal to the average degree . We note that is actually the Ky Fan k-norm, which for positive semi-definite matrices is the sum of k largest eigenvalues. The parameter is an active component of the present research and some work mostly on trees can be found in the literature [24]. In fact, it is shown in [25] that the Laplacian energy has remarkable chemical applications beyond the molecular orbital theory of conjugated molecules. For some recent works on Laplacian energy and related results, we refer to [2,26,27,28] and the references therein.
In case of and , the trace norm of are
Similarly, Laplacian energy of can be discussed for other values of n and various upper bounds and lower bounds can be obtained.
As zero-divisor graph of has been written in terms of the joined union, where components are either cliques or their complements, but, in general the zero-divisor graphs of ring R cannot be expressed as the joined union of graphs. So, their spectral analysis becomes difficult. No general method is yet available in discussing the spectra of zero-divisor graphs of rings such as and many other zero-divisor graphs associated with commutative as well as non-commutative rings. Also relating spectral properties with the graph invariants such as connectivity, chromatic number, matching number and other parameters are very interesting problems.
Author Contributions
Investigation, B.A.R., S.P., T.A.N. and Y.S.; Writing—original draft, B.A.R., S.P., T.A.N. and Y.S.; Writing—review and editing, B.A.R., S.P., T.A.N. and Y.S. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Informed Consent Statement
Not applicable.
Acknowledgments
The research of S. Pirzada is supported by the SERB-DST research project number MTR/2017/000084.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Cvetković, D.M.; Rowlison, P.; Simić, S. An Introduction to Theory of Graph Spectra Spectra of Graphs, Theory and Application; Lonndon Math. S. Student Text, 75; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
- Pirzada, S.; Ganie, H.A. On the Laplacian eigenvalues of a graph and Laplacian energy. Linear Algebra Appl. 2015, 486, 454–468. [Google Scholar] [CrossRef]
- Beck, I. Coloring of a commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
- Anderson, D.F.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef]
- Chattopadhyay, S.; Patra, K.L.; Sahoo, B.K. Laplacian eigenvalues of the zero-divisor graph of the ring ℤn. Linear Algebra Appl. 2020, 584, 267–286. [Google Scholar] [CrossRef]
- Magi, P.M.; Jose, S.M.; Kishore, A. Adjacency matrix and eigenvalues of the zero-divisor graph Γ(ℤn). J. Math. Comput. Sci. 2020, 10, 1285–1297. [Google Scholar]
- Pirzada, S.; Rather, B.A.; Aijaz, M.; Chishti, T.A. On distance signless Laplacian spectrum of graphs and spectrum of zero divisor graphs of ℤn. Linear Multilinear Algebra 2020. [Google Scholar] [CrossRef]
- Pirzada, S.; Rather, B.A.; Shaban, R.U.M. On signless Laplacian spectrum of zero divisor graphs of the ring ℤn. Korean J. Math. 2021. in print. [Google Scholar]
- Pirzada, S.; Rather, B.A.; Chishti, T.A. On distance Laplacian spectrum of zero divisor graphs ℤn. Carpathian Math. Publ. 2021. in print. [Google Scholar]
- Shang, Y. Lower bounds for the Estrada index using mixing time and Laplacian spectrum. Rocky Mt. J. Math. 2013, 43, 2009–2016. [Google Scholar] [CrossRef]
- Young, M. Adjacency matrices of zero-divisor graphs of integer modulo n. Involve 2015, 8, 753–761. [Google Scholar] [CrossRef]
- Anderson, D.F.; Weber, D. The zero-divisor graph of a commutative ring without identity. Int. Elect. J. Algebra 2018, 223, 176–202. [Google Scholar] [CrossRef]
- Pirzada, S.; Aijaz, M.; Imran, M. On zero-divisor graphs of the ring ℤn. Afr. Math. 2020, 31, 727–737. [Google Scholar] [CrossRef]
- Shang, Y. A note on the commutativity of prime near-rings. Algebra Colloq. 2015, 22, 361–366. [Google Scholar] [CrossRef]
- Pirzada, S. An Introduction to Graph Theory; Orient BlackSwan: Hyderabad, India, 2012. [Google Scholar]
- Koshy, T. Elementary Number Theory with Applications, 2nd ed.; Academic Press: Cambridge, MA, USA, 2007. [Google Scholar]
- Spiroff, S.; Wickham, C. A zero-divisor graph determined by equivalence classes of zero-divisors. Common. Algebra 2011, 39, 2338–2348. [Google Scholar] [CrossRef]
- Horn, R.; Johnson, C. Matrix Analysis; Cambridge University Press: Cambridge, UK, 1985. [Google Scholar]
- Cardoso, D.M.; Freitas, M.A.D.; Martins, E.N.; Robbiano, M. Spectra of graphs obtained by a generalization of the join of graph operations. Discret. Math. 2013, 313, 733–741. [Google Scholar] [CrossRef]
- Monsalve, J.; Rada, J. Oriented bipartite graphs with minimal trace norm. Linear Multilinear Algebra 2019, 67, 1121–1131. [Google Scholar] [CrossRef]
- Nikiforov, V. The trace norm of r-partite graphs and matrices. C. R. Acad. Sci. Paris Ser. I 2015, 353, 471–475. [Google Scholar] [CrossRef]
- Gutman, I.; Zhou, B. Laplacian energy of a graph. Linear Algebra Appl. 2006, 414, 29–37. [Google Scholar] [CrossRef]
- Fritscher, E.; Hoppen, C.; Rocha, I.; Trevisan, V. On the sum of the Laplacian eigenvalues of a tree. Linear Algebra Appl. 2011, 435, 371–399. [Google Scholar] [CrossRef][Green Version]
- Das, K.C.; Mojallal, S.A. Open problems on σ-invariant. Taiwan. J. Math. 2019, 23, 1041–1059. [Google Scholar] [CrossRef]
- Radenkovic, S.; Gutman, I. Total electron energy and Laplacian energy: How far the analog goes? J. Serb. Chem. Soc. 2007, 72, 1343–1350. [Google Scholar] [CrossRef]
- Alhevaz, A.; Baghipur, M.; Das, K.C.; Shang, Y. Sharp bounds on (generalized) distance energy of graphs. Mathematics 2020, 8, 426. [Google Scholar] [CrossRef]
- Ganie, H.A.; Pirzada, S.; Rather, B.A.; Trevisan, V. Further developments on Brouwer’s conjecture for the sum of Laplacian eigenvalues of graphs. Linear Algebra Appl. 2020, 588, 1–18. [Google Scholar] [CrossRef]
- Ganie, H.A.; Pirzada, S.; Rather, B.A.; Shaban, R. On Laplacian eigenvalues of graphs and Brouwer’s conjecture. J. Ramanujan Math. Soc. 2021, 36, 1–9. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).