257
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Randić spectrum of the weakly zero-divisor graph of the ring ℤn

, , &
Received 17 Jan 2024, Accepted 13 May 2024, Published online: 06 Jun 2024

Abstract

In this article, we find the Randić spectrum of the weakly zero-divisor graph of a finite commutative ring R with identity 10, denoted as WΓ(R), where R is taken as the ring of integers modulo n. The weakly zero-divisor graph of the ring R is a simple undirected graph with vertices representing non-zero zero-divisors in R. 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 WΓ(Zn) for specific values of n, which are products of prime numbers and their powers.

2020 Mathematics Subject Classification:

1 Introduction

In this research, we focus on connected, undirected, simple, and finite graphs. These graphs are denoted as C(ν,e), where ν and e represents the sets of vertices and edges in C, respectively. An edge between two vertices a and b in C is indicated by ab. The neighborhood of a vertex a in C, symbolized as NC(a), 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 Ka,b, 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 R with a non-zero multiplicative identity. Within, Ra non-zero element a is a zero-divisor if it satisfies ab = 0 for some non-zero bR. The set of these zero-divisors is denoted as Z(R), and Z(R)*=Z(R){0}. The ring of integers modulo a positive integer n is denoted as Zn. The adjacency matrix A of a graph C is a (0, 1) matrix reflecting the connections between vertices. The Randić matrix RC of C is defined based on the degrees of the vertices as follows: RC=(rij)={1dC(vi)dC(vj),vivj,0,otherwise.

This matrix is symmetric with real eigenvalues, ordered as χ1χ2χk. 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 Zn. Their research provided evidence indicating that the zero-divisor graph Γ(Zn) exhibits Randić integral. Nazim et al. [Citation8] examined normalized Laplacian spectra of the weakly zero-divisor graph of the ring Zn for different values of n.

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 WΓ(R) is an undirected graph whose vertices are non-zero zero-divisors of R 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 WΓ(Zn) for specific values of n, which are products of prime numbers and their powers.

We examine the Randić spectrum of the weakly zero-divisor graph WΓ(Zn) for some values of n{αβ,α2β,αβγ,αmβ}, where α, β, and γ are prime numbers with α<β<γ, and m2 is a positive integer. Also for n=α1α2αmβ1k1β2k2βrkr(ki2,m1,r0), 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 C(ν,e) be a graph of order n having vertex set {1,2,,n} and Ci(νi,ei) be disjoint graphs of order ni, 1in. The graph C[C1,C2,,Cn] is formed by taking the graphs C1,C2,,Cn and joining each vertex of Ci to every vertex of Cj whenever i and j are adjacent in C.

This operation C[C1,C2,,Cm] is also known as generalized join graph operation as defined in [Citation4], and it is also referred to as the C-join operation. If C=K2, the K2-join is the usual join operation, namely C1C2. In this context, we will continue to use the notation C[C1,C2,,Cm] and call it a C-join.

Let us explore the set of integers modulo n, which we denote as Zn. The order of the Z*(Zn) is nϕ(n)1, where ϕ(n) represents the Euler totient function. An integer u, where 1<u<n, is called a proper divisor of n if u|n. The number of all the divisors of n is denoted by τ(n). Now, suppose we have proper divisors of n, which we will denote as u1,u2,,uk. For each integer r in the range of 1 to k, let us consider sets of elements given by the following: Aur={xZn:(x,n)=ur}, where (x,n) signifies the largest common divisor between the values x and n. Furthermore, it is evident that AurAux=ϕ whenever rx. This fact implies that the sets Au1,Au2,,Auk are distinct from each other and they collectively divide and organize the vertex set of WΓ(Zn) in the following manner: V(WΓ(Zn))=Au1Au2Auk.

The subsequent lemma provides insight into the size of Aur.

Lemma 2.2.

[Citation16] If ur as a divisor of n, then |Aur|=ϕ(nur), 1rk.

Lemma 2.3.

[Citation15] Let us consider the set of proper divisors of n, which we can represent as u1,u2,,uk. Also, express the number n as n=p1p2pmq1k1q2k2qiki, where ki2, m1, and i0. If a proper divisor ur is one of the prime factors {p1,p2,,pm}, then the sub-graph induced in WΓ(Zn) by the set of elements Aur forms K¯ϕ(nur).

Corollary 2.4.

[Citation15] Consider ur is a proper divisor of the positive integer n. The following statements hold:

  1. The sub-graph WΓ(Aur) of WΓ(Zn), formed by the vertices in the set Aur, can take one of two forms: it’s either the complete graph Kϕ(nur), or it’s complement graph K¯ϕ(nur), where r is in the set {1,2,,k}.

  2. If r is not equal to x, where both r and x belong to the set {1,2,,k}, then a vertex within Aur is either connected to all vertices in Aux or not connected to any vertex in Aux within the graph WΓ(Zn).

Corollary 2.4, mentioned above shown that the sub-graphs WΓ(Aur), which are formed within the structure of WΓ(Zn), can be categorized as either complete graphs or empty graphs. The subsequent lemma asserts that WΓ(Zn) can be described as a composite structure comprising complete graphs and their corresponding complementary graphs. We define Υn* by a complete graph on the set {u1,u2,,uk} of all proper divisors of n.

Lemma 2.5.

[Citation15] Let the induced sub-graph WΓ(Aur) of WΓ(Zn) formed by the vertices in the set Aur, where 1rk. Then WΓ(Zn)=Υn*[WΓ(Au1),WΓ(Au2),,WΓ(Auk)].

Theorem 2.6.

[Citation1] Consider a graph denoted as C, where the vertex set ν(C) consists of elements from 1 to t. Let Ci’s represent ri -regular graphs of size ni for i ranging from 1 to t. If we express C as a combination of these graphs, denoted as C[C1,C2,,Ct], then the Randić spectrum of C can be determined as follows: σR(C)=(i=1t(ρNi+ri):ρσR(Ci){ri})σ(CR(C)), where Ni={jNC(i)nj,NC(i)ϕ,0,otherwise

and (2.1) CR(C)=(cij)t×t={riNi+ri,i=j,ninj(Ni+ri)(Nj+rj),ije(C),0otherwise.(2.1)

ρ is the adjacency eigenvalue of Ci.

A graph, denoted as C is considered to be a Randić integral graph if all its Randić eigenvalues are integer. The following statement provides a condition for a C-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 C-join graph C[C1,C2,,Ct] is Randić integral if and only if ρNi+riZ, for i=1,2,,t and matrix CR(C) is integral.

From Theorem 2.6, if Ci is isomorphic to K¯i, then we have ρNi+ri=0. In this scenario, the graph C, which is constructed as C[C1,C2,,Ct] exhibits a Randić integral characteristic if and only if the matrix CR(C) has integral values.

3 Randić spectrum of WΓ(Zn)

In this section, we determine the Randić spectrum of WΓ(Zn) for any arbitrary n. Let us denote the proper divisors of n as u1,u2,,uk. For each 1rk, we assign a weight of |Auk|=ϕ(nuk) to the vertex uk within the graph Υn*. The kth order weighted Randić matrix of Υn*, denoted as L(Υn*) and defined in Theorem 2.6, is represented as: (3.1) L(Υn*)=[t1,1t1,2t1,kt2,1t2,2t2,ktk,1tk,2tk,k],(3.1) where ti,j={ruirui+Mui,i=j,ϕ(nui)ϕ(nuj)(rui+Mui)(ruj+Muj),uiujΥn*,0,otherwise.

For 1ijk and Muj=uiNΥn*(uj)ϕ(nui).

The matrix known as L(Υn*) is termed the weighted Randić matrix associated with Υn*. An essential observation can be made when we compare the matrices CR(C) and L(Υn*).

Remark 3.1.

CR(C)=L(Υn*)

The primary finding in this research paper involves the presentation and demonstration of the Randić spectrum for the weakly zero-divisor graph of WΓ(Zn).

Theorem 3.2.

Consider the proper divisors of n are u1,u2,,uk. Then the Randić spectrum of WΓ(Zn) is given by σR(WΓ(Zn))=(i=1k(ρMui+rui):ρσR(WΓ(Aui)){rui})  σR(L(Υn*)), where WΓ(Aui) are ri -regular graph and ρ is the adjacency eigenvalue of WΓ(Aui).

Proof.

Based on Lemma 2.5, we can observe that WΓ(Zn)=Υn*[WΓ(Au1),WΓ(Au2),,WΓ(Auk)]. This implies that by utilizing the relationship CR(C)=L(Υn*) and utilizing the implications of Theorem 2.6, the outcome is established. □

Remember that the adjacency spectrum of complete graph Km and its complement graph K¯m with m vertices, including multiplicity, is as follows: {1m1m11} and {0m},respectively.

From Corollary 2.4, WΓ(Aui) is isomorphic to either Kϕ(nui) or K¯ϕ(nui). Consequently, as outlined in Theorem 3.2, there exists a total of nϕ(n)1 Randić eigenvalues associated with WΓ(Zn). Out of these, the value nϕ(n)1t has already been calculated. The remaining t Randić eigenvalues of WΓ(Zn) can be derived from the solutions to the characteristic polynomial of the matrix L(Υn*), as depicted in Equationequation (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 WΓ(Z18). (See ).

Fig. 1 The graph G1.

Fig. 1 The graph G1.

Let n=18=32×2. First, we can observe that Υ18* is the complete graph on 4 vertices. i.e., {2,3,6,9}. Then by Lemma 2.5, we have WΓ(Z18)=Υ18*[WΓ(A2),WΓ(A3),WΓ(A6),WΓ(A9)].

By using Lemma 2.3, also we can observe that WΓ(Z18)=Υ18*[K¯6,K2,K2,K1]. The cardinality |V| of the vertex set V of WΓ(Z18) is given by ϕ(2)+ϕ(3)+ϕ(6)+ϕ(9)=11. It follows that M2=ϕ(2)+ϕ(3)+ϕ(6)=|V|ϕ(9)=5,M3=|V|ϕ(6)=9,M6=|V|ϕ(3)=9,M9=|V|ϕ(2)=10. Also, we see that r2=r9=0 and r3=r6=1. Therefore, by Theorem 3.2, the Randić spectrum of WΓ(Z18) is σR(WΓ(Z18))=(i=14(ρrui+Mui:ρσR(WΓ(Aui)){rui}))σR(L(Υ18*))={1025}σR(L(Υ18*)).

Thus, the remaining 4 Randić eigenvalues are the eigenvalues of the matrix L(Υ18*)=[1106525256503565253502102565210110].

The estimated eigenvalues of the above matrix are {0.5096,0.4165,0.0822,1.2083}.

Now, we explore the Randić spectrum of Γ(Zn) for various values of n: when n=αβ,α2β,αβγ and αmβ, where α, β, and γ are prime numbers with α<β<γ, and m2 is a positive integer.

Proposition 3.4.

The Randić spectrum of WΓ(Zn), for n=αβ is given by {101 1α+β41}, where α, β are distinct primes.

Proof.

Let n=αβ, with α<β and α, β are distinct primes. First, we can observe that Υαβ* is the complete graph on 2 vertices so that Υαβ* is K2. Since rα=rβ=0 and (Mα,Mβ)=(α1,β1). Therefore, by Theorem 3.2, the Randić spectrum of WΓ(Zαβ) consists of the eigenvalue 0 with multiplicity α+β4 and the matrix L(Υαβ*) is given by L(Υαβ*)=[0110], which has eigenvalues 1 and –1. □

Proposition 3.5.

The Randić spectrum of WΓ(Zn), for n=α2β, where α, β are distinct primes, is given by {1|V|10x1x2x3x4ϕ(αβ)+ϕ(α)+ϕ(β)3ϕ(α2)11111}, where x1,x2,x3, and x4 represent the non-zero roots of the characteristic polynomial of matrix (3.2), and V denotes the set of vertices in WΓ(Zn).

Proof.

Let n=α2β, with α<β and α, β are distinct primes. First, we can observe that Υα2β* is the complete graph on 4 vertices {α,β,α2,αβ}. Then by Lemma 2.5, we have WΓ(Zα2β)=Υα2β*[WΓ(Aα),WΓ(Aβ),WΓ(Aα2),WΓ(Aαβ)].

By using Lemma 2.3, also we can observe that WΓ(Zα2β)=Υα2β*[Kϕ(αβ),K¯ϕ(α2),Kϕ(β),Kϕ(α)].

Cardinality |V| of the vertex set V of WΓ(Zα2β) is given by ϕ(αβ)+ϕ(α2)+ϕ(β)+ϕ(α). It follows that Mα=ϕ(α2)+ϕ(β)+ϕ(α)=|V|ϕ(αβ),Mβ=|V|ϕ(α2),Mα2=|V|ϕ(β) and Mαβ=|V|ϕ(α). Also, we have rα=ϕ(αβ)1,rα2=ϕ(β)1,rαβ=ϕ(α)1 and rβ=0. Therefore, by Theorem 3.2, the Randić spectrum of WΓ(Zα2β) is σR(WΓ(Zα2β))=(i=14(ρrui+Mui:ρσR(WΓ(Aui)){rui}))σR(L(Υα2β*))={1|V|10ϕ(αβ)+ϕ(α)+ϕ(β)3ϕ(α2)1}σR(L(Υα2β*)).

Thus, the remaining 4 Randić eigenvalues are the eigenvalues of the matrix (3.2) L(Υα2β*)=[ϕ(αβ)1|V|1ABCA0DEBDϕ(β)1|V|1FCEFϕ(α)1|V|1].(3.2)

Where A=ϕ(αβ)ϕ(α2)(|V|1)(|V|ϕ(α2)), B=ϕ(αβ)ϕ(β)|V|1, C=ϕ(αβ)ϕ(α)|V|1, D=ϕ(α2)ϕ(β)(|V|1)(|V|ϕ(α2)), E=ϕ(α2)ϕ(α)(|V|1)(|V|ϕ(α2)), and F=ϕ(α)ϕ(β)|V|1. □

Proposition 3.6.

The Randić spectrum of WΓ(Zn), for n=αβγ, with α<β<γ and α, β, γ are distinct primes, is given by σR(WΓ(Zαβγ))={01|V|1ϕ(αβ)+ϕ(αγ)+ϕ(βγ)3ϕ(α)+ϕ(β)+ϕ(γ)3}, where V represents the set of vertices in WΓ(Zn). The remaining Randić eigenvalues of WΓ(Zαβγ) can be determined from the solutions to the characteristic polynomial of matrix (3.3).

Proof.

Let n=αβγ, 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 WΓ(Zαβγ)=Υαβγ*[WΓ(Aα),WΓ(Aβ),WΓ(Aγ),WΓ(Aαβ),  WΓ(Aαγ),WΓ(Aβγ)].

By using Lemma 2.3, we can observe that WΓ(Zαβγ)=Υαβγ*[K¯ϕ(βγ),K¯ϕ(αγ),K¯ϕ(αβ),Kϕ(γ),Kϕ(β),Kϕ(α)].

The cardinality |V| of the vertex set V of WΓ(Zαβγ) is given by ϕ(α)+ϕ(β)+ϕ(γ)+ϕ(αβ)+ϕ(αγ)+ϕ(βγ). It follows that Mα=ϕ(α)+ϕ(β)+ϕ(γ)+ϕ(αβ)+ϕ(αγ)=|V|ϕ(βγ),Mβ=|V|ϕ(αγ),Mγ=|V|ϕ(αβ),Mαβ=|V|ϕ(γ),Mαγ=|V|ϕ(β) and Mβγ=|V|ϕ(α). Also, we see that rα=rβ=rγ=0 and rαβ=ϕ(γ)1,rαγ=ϕ(β)1 and rβγ=ϕ(α)1. Therefore, by Theorem 3.2, the Randić spectrum of WΓ(Zαβγ) is σR(WΓ(Zαβγ))=(i=16(ρrui+Mui:ρσR(WΓ(Aui)){rui}))σR(L(Υαβγ*))={01|V|1ϕ(αβ)+ϕ(αγ)+ϕ(βγ)3ϕ(α)+ϕ(β)+ϕ(γ)3}σR(L(Υαβγ*)).

Thus, the remaining 6 Randić eigenvalues are the eigenvalues of the matrix (3.3) L(Υαβγ*)=[0A12A13A14A15A16A120B23B24B25B26A13B230C34C35C36A14B24C34ϕ(γ)1|V|1D45D46A15B25C35D45ϕ(β)1|V|1E56A16B26C36D46E56ϕ(α)1|V|1].(3.3)

Where A12=ϕ(βγ)ϕ(αγ)(|V|ϕ(βγ))(|V|ϕ(αγ)), A13=ϕ(βγ)ϕ(αβ)(|V|ϕ(βγ))(|V|ϕ(αβ)), A14=ϕ(βγ)ϕ(γ)(|V|ϕ(βγ))(|V|1), A15=ϕ(βγ)ϕ(β)(|V|ϕ(βγ))(|V|1), A16=ϕ(βγ)ϕ(α)(|V|ϕ(βγ))(|V|1), B23=ϕ(αγ)ϕ(αβ)(|V|ϕ(αγ))(|V|ϕ(αβ)), B24=ϕ(αγ)ϕ(γ)(|V|ϕ(αγ))(|V|1, B25=ϕ(αγ)ϕ(β)(|V|ϕ(αγ))(|V|1), B26=ϕ(αγ)ϕ(α)(|V|ϕ(αγ))(|V|1), C34=ϕ(αβ)ϕ(γ)(|V|ϕ(αβ))(|V|1), C35=ϕ(αβ)ϕ(β)(|V|ϕ(αβ))(|V|1), C36=ϕ(αβ)ϕ(α)(|V|ϕ(αβ))(|V|1), D45=ϕ(γ)ϕ(β)(|V|1),

D46=ϕ(γ)ϕ(α)(|V|1), and E56=ϕ(β)ϕ(α)(|V|1). □

Theorem 3.7.

The Randić spectrum of WΓ(Zn), for n=αmβ (m2), where α, β are distinct primes is given by σR(WΓ(Zαmβ))={1|V|10(i=1mϕ(αmiβ)+i=1m1ϕ(αmi))(2m1)ϕ(αm)1}, where V represents the set of vertices in WΓ(Zn). The remaining Randić eigenvalues of WΓ(Zn) can be found from the solutions to the characteristic polynomial of matrix (3.4).

Proof.

Let n=αmβ(m2). The vertex set of the graph Υαmβ* comprises the elements from the set {α,α2,,αm, β,αβ,α2β,,αm1β}. Then by using Lemma 2.5, we have WΓ(Zαmβ)=Υαmβ*[WΓ(Aα),WΓ(Aα2),,WΓ(Aαm),WΓ(Aβ),  WΓ(Aαβ),WΓ(Aα2β),,WΓ(Aαm1β)].

By Lemma 2.3, also we can observe that WΓ(Zαmβ)=Υαmβ*[Kϕ(αm1β),Kϕ(αm2β),,Kϕ(β),K¯ϕ(αm),Kϕ(αm1),,Kϕ(α)].

Cardinality |V| of the vertex set V of WΓ(Zαmβ) is given by ϕ(αm1β)+ϕ(αm2β)+ϕ(αm3β)++ϕ(β)+ϕ(αm1)+ϕ(αm2)+ϕ(αm3)++ϕ(α)+ϕ(αm). It follows that Mα=ϕ(αm)+ϕ(αm2β)+ϕ(αm3β)++ϕ(β)+ϕ(αm1)+ϕ(αm2)+ϕ(αm3)++ϕ(α)=|V|ϕ(αm1β),Mα2=|V|ϕ(αm2β),,Mαm=|V|ϕ(β),Mαβ=|V|ϕ(αm1),,Mαrβ=|V|ϕ(αmr),,Mαm1β=|V|ϕ(α),Mβ=|V|ϕ(αm). Also, rα=ϕ(αm1β)1,rα2=ϕ(αm2β)1,,rαm=ϕ(β)1,rαβ=ϕ(αm1)1,,rαkβ=ϕ(αmk)1,,rαm1β=ϕ(α)1 and rβ=0. Therefore, by Theorem 3.2, the Randić spectrum of WΓ(Zαmβ) is given by σR(WΓ(Zαmβ))=(ρrα+Mα:ρσR(WΓ(Aα)){rα})(ρrα2+Mα2:ρσR(WΓ(Aα2)){rα2})(ρrαm+Mαm:ρσR(WΓ(Aαm)){rαm})(ρrβ+Mβ:ρσR(WΓ(Aβ)){rβ})(ρrαβ+Mαβ:ρσR(WΓ(Aαβ)){rαβ})(ρrαm1β+Mαm1β:ρσR(WΓ(Aαm1β)){rαm1β})σR(L(Υαmβ*))={1|V|10(i=1mϕ(αmiβ)+i=1m1ϕ(αmi))(2m1)ϕ(αm)1}σR(L(Υαmβ*)).

The remaining 2m Randić eigenvalues are the eigenvalues of this matrix L(Υαmβ*)= (3.4) [ϕ(αm1β)ϕ(αm2β)|V|1ϕ(αm1β)ϕ(β)|V|1ϕ(αm1β)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(αm1β)ϕ(αm1)|V|1ϕ(αm1β)ϕ(α2)|V|1ϕ(αm1β)ϕ(α)|V|1ϕ(αm1β)ϕ(αm2β)|V|1ϕ(αm2β)1|V|1ϕ(αm2β)ϕ(β)|V|1ϕ(αm2β)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(αm2β)ϕ(αm1)|V|1ϕ(αm2β)ϕ(α2)|V|1ϕ(αm2β)ϕ(α)|V|1ϕ(αm1β)ϕ(β)|V|1ϕ(αm2β)ϕ(β)|V|1ϕ(β)1|V|1ϕ(β)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(β)ϕ(αm1)|V|1ϕ(β)ϕ(α2)|V|1ϕ(β)ϕ(α)|V|1ϕ(αm2β)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(αm2β)ϕ(αm)(|V|1)(|V|ϕ(αm))0ϕ(αm1)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(α2)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(α)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(αm1β)ϕ(αm1)|V|1ϕ(αm2β)ϕ(αm1)|V|1ϕ(β)ϕ(αm1)|V|1ϕ(αm1)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(αm1)1|V|1ϕ(αm1)ϕ(α2)|V|1ϕ(αm1)ϕ(α)|V|1ϕ(αm1β)ϕ(α2)|V|1ϕ(αm2β)ϕ(α2)|V|1ϕ(β)ϕ(α2)|V|1ϕ(α2)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(αm1)ϕ(α2)|V|1ϕ(α2)1|V|1ϕ(α2)ϕ(α)|V|1ϕ(αm1β)ϕ(α)|V|1ϕ(αm2β)ϕ(α)|V|1ϕ(β)ϕ(α)|V|1ϕ(α)ϕ(αm)(|V|1)(|V|ϕ(αm))ϕ(αm1)ϕ(α)|V|1ϕ(α2)ϕ(α)|V|1ϕ(α)1|V|1].(3.4)

Theorem 3.8.

Let n=α1α2αmβ1k1β2k2βrkr(ki2,m1,r0), where αi ’s and βi ’s are distinct primes. Suppose {u1,u2,,uτ(n)2} represents the collection of all proper divisors of n. Then the Randić spectrum of WΓ(Zn) is determined as follows: {01|V|1i=1mϕ(nαi)muiαiϕ(nui)(τ(n)2m)}, where V represents the set of vertices in WΓ(Zn). The remaining Randić eigenvalues of WΓ(Zn) can be determined from the solutions to the characteristic polynomial of matrix (3.5).

Proof.

Suppose that n=α1α2αmβ1k1β2k2βrkr(ki2,m1,r0), where αi ’s and βi ’s are distinct primes. Let D={α1,α2,,αm}, then by using Theorem 3.2, the Randić spectrum of WΓ(Zn) is σR(WΓ(Zn))=uiD(ρrui+rui:ρσR(WΓ(Aui)){rui})uiD(ρrui+rui:ρσR(WΓ(Aui)){rui})σR(L(Υn*)).

Using Lemmas 2.2, 2.3, and Corollary 2.4, we can deduce the following outcomes for each uiD. Specifically, we establish that WΓ(Aui) is a complement of a complete graph K¯ϕ(nui), and for ujD, we find that WΓ(Auj) is a complete graph Kϕ(nuj). It is worth noting that the size, denoted as |V|, of the vertex set V within the graph WΓ(Zn) equals the sum of ϕ(nui) for i ranging from 1 to τ(n)2. In other words, |V| can be expressed as (i=1τ(n)2ϕ(nui)). Additionally, it should be observed that for values of i within the range of 1 to τ(n)2, the following relationship holds: Mui=j=1,jiτ(n)2ϕ(nuj)=|V|ϕ(nui).

Also, rui=0, for uiD and ruj=ϕ(nuj)1, for ujD. Thus, we obtain σR(WΓ(Zn))=uiD(0:ρσR(K¯ϕ(nui))){rui})ujD(ρ|V|1:ρσR(Kϕ(nuj))){ruj})σR(L(Υn*))=uiD(0ϕ(nui)1)ujD(1|V|1ϕ(nuj)1)σR(L(Υn*))=(01|V|1i=1mϕ(nαi)muiαiϕ(nui)(τ(n)2m))σR(L(Υn*)).

Thus, the remaining Randić eigenvalues are the eigenvalues of the matrix L(Υn*)= (3.5) [0ϕ(nu1)ϕ(nu2)(|V|ϕ(nu1))(|V|ϕ(nu2))ϕ(nu1)ϕ(num)(|V|ϕ(nu1))(|V|ϕ(num))ϕ(nu1)ϕ(num+1)(|V|ϕ(nu1))(|V|1)ϕ(nu1)ϕ(nuτ(n)2)(|V|ϕ(nu1))(|V|1)ϕ(nu1)ϕ(nu2)(|V|ϕ(nu1))(|V|ϕ(nu2))0ϕ(nu2)ϕ(num)(|V|ϕ(nu2))(|V|ϕ(num))ϕ(nu2)ϕ(num+1)(|V|ϕ(nu2))(|V|1)ϕ(nu2)ϕ(nuτ(n)2)(|V|ϕ(nu2))(|V|1)ϕ(nu2)ϕ(num)(|V|ϕ(nu2))(|V|ϕ(num))0ϕ(num)ϕ(num+1)(|V|ϕ(num))(|V|1)ϕ(num)ϕ(nuτ(n)2)(|V|ϕ(num))(|V|1)ϕ(nu1)ϕ(num+1)(|V|ϕ(nu1))(|V|1)ϕ(nu2)ϕ(num+1)(|V|ϕ(nu2))(|V|1)ϕ(num)ϕ(num+1)(|V|ϕ(num))(|V|1)ϕ(num+1)1|V|1ϕ(num+1)ϕ(nuτ(n)2)|V|1ϕ(nu1)ϕ(nuτ(n)2)(|V|ϕ(nu1))(|V|1)ϕ(nu2)ϕ(nuτ(n)2)(|V|ϕ(nu2))(|V|1)ϕ(num)ϕ(nuτ(n)2)(|V|ϕ(num))(|V|1)ϕ(num+1)ϕ(nuτ(n)2)|V|1ϕ(nuτ(n)2)1|V|1].(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.