Abstract
In this article, we find the Randić spectrum of the weakly zero-divisor graph of a finite commutative ring with identity , denoted as , where is taken as the ring of integers modulo . The weakly zero-divisor graph of the ring is a simple undirected graph with vertices representing non-zero zero-divisors in . Two vertices, denoted as a and b, are connected if there are elements x in the annihilator of a and y in the annihilator of b such that their product xy equals zero. In particular, we examine the Randić spectrum of for specific values of , which are products of prime numbers and their powers.
1 Introduction
In this research, we focus on connected, undirected, simple, and finite graphs. These graphs are denoted as , where ν and e represents the sets of vertices and edges in , respectively. An edge between two vertices a and b in is indicated by . The neighborhood of a vertex a in , symbolized as , refers to the set of vertices directly connected to a. The degree of a vertexa, denoted asdeg(a), is the number of adjacent edges to a. A graph is termed r-regular if each vertex has the same degree r. Complete graphs with vertices a and complete bipartite graphs with vertex sets of sizes, (a, b) are represented as Ka and respectively. It is also essential to point out that the sources referenced in [Citation6, Citation10, Citation16] may contain additional symbols and terms that have not been defined or discussed in this text.
This study also involves a finite commutative ring with a non-zero multiplicative identity. Within, a non-zero element a is a zero-divisor if it satisfies ab = 0 for some non-zero . The set of these zero-divisors is denoted as , and . The ring of integers modulo a positive integer is denoted as . The adjacency matrix A of a graph is a (0, 1) matrix reflecting the connections between vertices. The Randić matrix of is defined based on the degrees of the vertices as follows:
This matrix is symmetric with real eigenvalues, ordered as More about the Randić matrix can be found in [Citation1, Citation2]. Various aspects of zero-divisor graphs have been explored in previous studies, as documented in prior works such as [Citation3, Citation5, Citation7, Citation12, Citation13]. Rather et al. [Citation11] conducted a study focusing on the Randić spectrum of the zero-divisor graph for the ring . Their research provided evidence indicating that the zero-divisor graph exhibits Randić integral. Nazim et al. [Citation8] examined normalized Laplacian spectra of the weakly zero-divisor graph of the ring for different values of
This paper extends the research on the Randić spectrum of the weakly zero-divisor graphs. Nikmehr et al. [Citation9], first introduce the concept of a weakly zero-divisor graph. The weakly zero-divisor graph is an undirected graph whose vertices are non-zero zero-divisors of with a unique adjacency condition. Additional details regarding the weakly zero-divisor graphs can be located in the references cited as [Citation14, Citation15]. We investigate the Randić spectrum of for specific values of , which are products of prime numbers and their powers.
We examine the Randić spectrum of the weakly zero-divisor graph for some values of , where α, β, and γ are prime numbers with , and is a positive integer. Also for , where αi ’s and βi ’s are distinct primes. Computational tools like Wolfram Mathematica are employed for approximating eigenvalues and characteristic polynomials of various matrices.
2 Preliminaries
We begin by introducing the fundamental definitions and existing research results that will be used to form the main conclusions.
Definition 2.1.
Let be a graph of order having 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 operation is also known as generalized join graph operation as defined in [Citation4], and it is also referred to as the -join operation. If , the K2-join is the usual join operation, namely . In this context, we will continue to use the notation and call it a -join.
Let us explore the set of integers modulo , which we denote as . The order of the is , where represents the Euler totient function. An integer u, where , is called a proper divisor of if . The number of all the divisors of is denoted by . Now, suppose we have proper divisors of , which we will denote as . For each integer r in the range of 1 to k, let us consider sets of elements given by the following: where signifies the largest common divisor between the values x and . Furthermore, it is evident that whenever . This fact implies that the sets are distinct from each other and they collectively divide and organize the vertex set of in the following manner:
The subsequent lemma provides insight into the size of .
Lemma 2.2.
[Citation16] If ur as a divisor of , then .
Lemma 2.3.
[Citation15] Let us consider the set of proper divisors of , which we can represent as . Also, express the number as , where , and . If a proper divisor ur is one of the prime factors , then the sub-graph induced in by the set of elements forms .
Corollary 2.4.
[Citation15] Consider ur is a proper divisor of the positive integer . The following statements hold:
The sub-graph of , formed by the vertices in the set , can take one of two forms: it’s either the complete graph , or it’s complement graph , where r is in the set .
If r is not equal to x, where both r and x belong to the set , then a vertex within is either connected to all vertices in or not connected to any vertex in within the graph .
Corollary 2.4, mentioned above shown that the sub-graphs , which are formed within the structure of , can be categorized as either complete graphs or empty graphs. The subsequent lemma asserts that can be described as a composite structure comprising complete graphs and their corresponding complementary graphs. We define by a complete graph on the set of all proper divisors of .
Lemma 2.5.
[Citation15] Let the induced sub-graph of formed by the vertices in the set , where . Then
Theorem 2.6.
[Citation1] Consider a graph denoted as , where the vertex set consists of elements from 1 to t. Let ’s represent ri -regular graphs of size for i ranging from 1 to t. If we express as a combination of these graphs, denoted as , then the Randić spectrum of can be determined as follows: where
and (2.1) (2.1)
ρ is the adjacency eigenvalue of .
A graph, denoted as is considered to be a Randić integral graph if all its Randić eigenvalues are integer. The following statement provides a condition for a -join graph to possess this integral attribute, and the proof of this condition can be readily deduced from Theorem 2.6.
Proposition 2.7.
The -join graph is Randić integral if and only if for and matrix is integral.
From Theorem 2.6, if is isomorphic to , then we have . In this scenario, the graph , which is constructed as exhibits a Randić integral characteristic if and only if the matrix has integral values.
3 Randić spectrum of
In this section, we determine the Randić spectrum of for any arbitrary . Let us denote the proper divisors of as . For each , we assign a weight of to the vertex uk within the graph . The kth order weighted Randić matrix of , denoted as and defined in Theorem 2.6, is represented as: (3.1) (3.1) where
For and .
The matrix known as is termed the weighted Randić matrix associated with . An essential observation can be made when we compare the matrices and .
Remark 3.1.
The primary finding in this research paper involves the presentation and demonstration of the Randić spectrum for the weakly zero-divisor graph of .
Theorem 3.2.
Consider the proper divisors of are . Then the Randić spectrum of is given by where are ri -regular graph and ρ is the adjacency eigenvalue of .
Proof.
Based on Lemma 2.5, we can observe that This implies that by utilizing the relationship and utilizing the implications of Theorem 2.6, the outcome is established. □
Remember that the adjacency spectrum of complete graph and its complement graph with vertices, including multiplicity, is as follows:
From Corollary 2.4, is isomorphic to either or . Consequently, as outlined in Theorem 3.2, there exists a total of Randić eigenvalues associated with . Out of these, the value has already been calculated. The remaining t Randić eigenvalues of can be derived from the solutions to the characteristic polynomial of the matrix , as depicted in Equationequation (3.1)(3.1) (3.1) .
Utilizing Theorem 3.2, we can examine the provided diagram below to compute the Randić spectrum.
Example 3.3.
The Randić spectrum of the weakly zero-divisor graph . (See ).
Let . First, we can observe that is the complete graph on 4 vertices. i.e., Then by Lemma 2.5, we have
By using Lemma 2.3, also we can observe that The cardinality of the vertex set V of is given by . It follows that Also, we see that and . Therefore, by Theorem 3.2, the Randić spectrum of is
Thus, the remaining 4 Randić eigenvalues are the eigenvalues of the matrix
The estimated eigenvalues of the above matrix are
Now, we explore the Randić spectrum of for various values of : when and , where α, β, and γ are prime numbers with , and is a positive integer.
Proposition 3.4.
The Randić spectrum of for is given by where α, β are distinct primes.
Proof.
Let , with and α, β are distinct primes. First, we can observe that is the complete graph on 2 vertices so that is K2. Since and . Therefore, by Theorem 3.2, the Randić spectrum of consists of the eigenvalue 0 with multiplicity and the matrix is given by which has eigenvalues 1 and –1. □
Proposition 3.5.
The Randić spectrum of for , where α, β are distinct primes, is given by where , and x4 represent the non-zero roots of the characteristic polynomial of matrix (3.2), and V denotes the set of vertices in .
Proof.
Let , with and α, β are distinct primes. First, we can observe that is the complete graph on 4 vertices . Then by Lemma 2.5, we have
By using Lemma 2.3, also we can observe that
Cardinality of the vertex set V of is given by . It follows that and . Also, we have and Therefore, by Theorem 3.2, the Randić spectrum of is
Thus, the remaining 4 Randić eigenvalues are the eigenvalues of the matrix (3.2) (3.2)
Where , , , , , and . □
Proposition 3.6.
The Randić spectrum of , for , with and α, β, γ are distinct primes, is given by where V represents the set of vertices in . The remaining Randić eigenvalues of can be determined from the solutions to the characteristic polynomial of matrix (3.3).
Proof.
Let , with and α, β, γ are distinct primes. First, we can observe that is the complete graph on 6 vertices. i.e., , and . Then by using Lemma 2.5, we have
By using Lemma 2.3, we can observe that
The cardinality of the vertex set V of is given by . It follows that and . Also, we see that and and . Therefore, by Theorem 3.2, the Randić spectrum of is
Thus, the remaining 6 Randić eigenvalues are the eigenvalues of the matrix (3.3) (3.3)
Where , ,
, and . □
Theorem 3.7.
The Randić spectrum of , for , where α, β are distinct primes is given by where V represents the set of vertices in . The remaining Randić eigenvalues of can be found from the solutions to the characteristic polynomial of matrix (3.4).
Proof.
Let . The vertex set of the graph comprises the elements from the set . Then by using Lemma 2.5, we have
By Lemma 2.3, also we can observe that
Cardinality of the vertex set V of is given by . It follows that Also, and Therefore, by Theorem 3.2, the Randić spectrum of is given by
□
The remaining Randić eigenvalues are the eigenvalues of this matrix (3.4) (3.4)
Theorem 3.8.
Let , where αi ’s and βi ’s are distinct primes. Suppose represents the collection of all proper divisors of . Then the Randić spectrum of is determined as follows: where V represents the set of vertices in . The remaining Randić eigenvalues of can be determined from the solutions to the characteristic polynomial of matrix (3.5).
Proof.
Suppose that , where αi ’s and βi ’s are distinct primes. Let , then by using Theorem 3.2, the Randić spectrum of is
Using Lemmas 2.2, 2.3, and Corollary 2.4, we can deduce the following outcomes for each . Specifically, we establish that is a complement of a complete graph , and for , we find that is a complete graph . It is worth noting that the size, denoted as , of the vertex set V within the graph equals the sum of for i ranging from 1 to . In other words, can be expressed as . Additionally, it should be observed that for values of i within the range of 1 to , the following relationship holds:
Also, , for and , for . Thus, we obtain
□
Thus, the remaining Randić eigenvalues are the eigenvalues of the matrix (3.5) (3.5)
Acknowledgments
The authors are deeply grateful to the anonymous reviewers for their thorough review and constructive feedback, which greatly enriched the quality and depth of this manuscript.
Disclosure statement
The authors confirm that there are no conflicts of interest pertaining to this paper. The decision to publish in this journal was solely determined by the authors independent judgment.
References
- Andrade, E., Gomes, H., Robbiano, M. (2017). Spectra and Randić spectra of caterpillar graphs and applications to the energy. MATCH Commun. Math. Comput. Chem. 77: 61–75.
- Bozkurt, S., Gungór, A. D., Gutman, I., Cevik, A. S. (2010). Randić matrix and Randić energy. MATCH Commun. Math. Comput. Chem. 64: 239–250.
- Ashraf, M., Mozumder M. R., Rashid, M., Nazim. (2024). On Aα spectrum of the zero-divisor graph of the ring Zn Discrete Math. Algorithm. Appl. 17(4): 2350036.
- Cardoso, D. M., De Freitas, M. A., Martins E. N., Robbiano, M. (2013). Spectra of graphs obtained by a generalization of the join of graph operations. Discrete Math. 313: 917–930.
- Chattopadhyay, S., Patra, K. L., Sahoo, B. K. (2020). Laplacian eigenvalues of the zero-divisor graph of the ring Zn . Linear Algebra Appl. 584: 267–286.
- Cvetković, D. M., Rowlison, P., Simić, S. (2010). An Introduction to the Theory of Graph spectra. London Mathematical Society Student Texts, 75. Cambridge: Cambridge University Press.
- Rashid, M., Alali, S., Mozumder, M. R., Ahmad W. (2023). Spectrum of cozero-divisor graph associated to ring Zn . Axioms 12: 957.
- Nazim, Rehman, N. U., Alghamdi, A. (2023). On normalized Laplacian spectra of the weakly zero-divisor graph of the ring Zn . Mathematics (11): 4310.
- Nikmehr, M. J., Azadi, A., Nikandish, R. (2021). The weakly zero-divisor graph of a commuative ring. Rev. Un. Mat. Argentina 62(1): 105–116.
- Pirzada, S. (2012). An Introduction to Graph Theory. Orient Black-Swan, Hyderabad: Universities Press.
- Rather, B. A., Pirzada, S., Imran Bhat, M., Chishti, T. A. (2023). On Randić spectrum of zero-divisor graphs of commutative ring Zn . Commun. Comb. Optim. 8(1): 103–113.
- Rashid, M., Mozumder, M. R., Anwar, M. (2023). Signless Laplacian spectrum of the cozero-divisor graph of the commuatative ring Zn . Georgian Math. J.
- Rehman, N. U., Nazim, Nazim, M. (2024). Exploring normalized distance Laplacian eigenvalues of the zero-divisor graph Zn . Rend. Circ. Mat. Palermo (2). 73: 515–526.
- Rehman, N., Nazim, M., Mir, S. A. On the planarity, genus and crosscap of weakly zero-divisor graph of commutative rings. Rev. Un. Mat. Argentina., accepted.
- Shariq, M., Mathil, P., Kumar, J. Laplacian spectrum of weakly zero-dvisor graph of the ring Zn . arXiv2023.
- Young, M. (2015). Adjacency matrices of zero-divisor graphs of integer modulo n. Involve 8: 753–761.