Preprint
Article

This version is not peer-reviewed.

On Dα-Spectrum of the Weakly Zero-Divisor Graph

A peer-reviewed article of this preprint also exists.

Submitted:

01 April 2025

Posted:

02 April 2025

You are already at the latest version

Abstract
Let us consider the finite commutative ring R, whose unity is 1≠0. Its weakly zero-divisor graph, represented as WΓ(R), is a basic undirected graph with two distinct vertices, c1 and c2 that are adjacent if and only if there exist r∈ ann(c1) and s∈ ann(c2) that satisfy the condition rs=0. Let D(G) be the distance matrix and Tr(G) be the diagonal matrix of the vertex transmissions, in basic undirected connected graph G. The Dα matrix of graph G is defined as Dα(G)=αTr(G)+(1−α)D(G) for α∈[0,1]. This article find the Dα spectrum for the graph WΓ(Zn) for various value of n and also shows that WΓ(Zn) for n=ϑ1ϑ2ϑ3⋯ϑtη1d1η2d2⋯ηsds(di≥2,t≥1,s≥0) where ϑi’s and ηi’s are the distinct primes is Dα integral.
Keywords: 
;  ;  ;  

1. Introduction

In this article, a commutative ring having identity 1 0 shall be denoted by R . When an element c 2 , different from zero (0 c 2 R ), exists such that c 1 c 2 = 0 , then the nonzero element c 1 is called a zero-divisor of R. Z ( R ) is the collection of those zero-divisors in the ring R and Z ( R ) * = Z ( R ) { 0 } .
The graph G = ( V , E ) has been defined, where V denotes the set of vertices and E denotes the set of edges of G. When two distinct vertices of graph G, c 1 and c 2 are adjacent to each other in graph G, the notation c 1 c 2 represents this. In a graph G, the set of vertices adjacent to a vertex c is called its neighborhood; this neighborhood is represented by the notation N G ( c ) . K m refers to the complete graph with m vertices. d e g ( c ) , the degree of vertex c, represents the number of edges incident with c V . If d e g ( c ) = 0 , then c is referred to as an isolated vertex. For every vertex c G , G is k-regular if d e g ( c ) = k . Let A be any square matrix and let λ 1 , λ 2 , λ 3 , , λ k be its different eigenvalues with multiplicities f 1 , f 2 , f 3 , , f k respectively. The s p e c t r u m of A is then denoted by σ (A), which is defined by
σ ( A ) = λ 1 λ 2 λ 3 λ k f 1 f 2 f 3 f k .
For a graph G, the a d j a c e n c y matrix A ( G ) is a n-dimensional square matrix given by
A ( G ) = ( a i j ) = 1 , c i c j 0 , o t h e r w i s e .
The convex linear combinations of the adjacency matrix A ( G ) of G and the diagonal matrix of its vertices D d e g ( G ) were proposed by Nikiforov [8]. This means that A α ( G ) = α A ( G ) + ( 1 α ) D d e g ( G ) for α [ 0 , 1 ] , where A α ( G ) is referred to as the generalized adjacency matrix or A α ( G ) matrix of G. Similarly, the generalized distance matrix D α ( G ) was presented by Cui, He, and Tian [14] as the convex combination of T ( G ) and D ( G ) for α [ 0 , 1 ] , D α ( G ) = α T ( G ) + ( 1 α ) D ( G ) where D ( G ) represents the distance matrix of G and T ( G ) the transmission matrix of G. If all the D α eigenvalues of a graph G are integers then G is said to be D α integral.
Nikmehre et al. [9] introduced the idea of a weakly zero-divisor graph of ring R. The weakly zero-divisor graph of ring R is represented by the symbol W Γ ( R ) . There are two distinct vertices, c 1 and c 2 , that are adjacent if and only if there exists r ann ( c 1 ) and s ann ( c 2 ) , satisfying the condition r s = 0 . This undirected simple graph W Γ ( R ) has a vertex set as the set of non-zero zero-divisors of R. The weakly zero-divisor graph’s spanning sub-graph is easily observed to be the zero-divisor graph of a ring.
The D α spectrum of the weakly zero-divisor graph of Z n is found in this paper for various values of n. More information about spectrum of graphs and additional information on various types of graphs based on commutative ring can be found in [1,5,6,7,10,11,12]. The definitions, lemma’s and theorems that are utilized to support the main results are analyzed in section 2. D α eigenvalues of W Γ ( Z n ) are looked into section 4, for n = ϑ 1 ϑ 2 , ϑ 1 2 ϑ 2 , ϑ 1 ϑ 2 ϑ 3 , ϑ 1 2 j , ϑ 1 2 j + 1 , ϑ 1 t ϑ 2 where ϑ 1 , ϑ 2 and ϑ 3 are prime numbers with ϑ 1 < ϑ 2 < ϑ 3 and j 3 , t 2 are positive integers. Also, we calculate the D α spectrum of the weakly zero-divisor W Γ ( Z n ) , for n = ϑ 1 ϑ 2 ϑ 3 ϑ t η 1 d 1 η 2 d 2 η s d s ( d s 2 , t 1 , s 0 ) where ϑ i ’s and η i ’s are distinct primes and shows that W Γ ( Z n ) is D α integral.

2. Preliminaries

Definition 2.1. 
“ Let G ( V , E ) be a graph of order m having vertex set { c 1 , c 2 , , c m } and F k ( V k , E k ) be disjoint graphs of order m k , 1 k m . The graph F 1 , F 2 , , F m formed the generalized join graph G [ F 1 , F 2 , , F m ] and whenever k and l are adjacent in G, joined each vertex of F k to every vertex of F l ."
τ ( j 1 ) indicates the number of positive divisors of a positive integer j 1 . For j 2 to not divide j 1 , we write j 2 j 1 . The greatest common divisor of j 1 and j 2 is shown by ( j 1 , j 2 ) . The number of positive integers smaller than or equal to j 1 that are relatively prime to j 1 is indicated by Eulur’s phi function ϕ ( j 1 ) . If j 1 = ϑ 1 h 1 ϑ 2 h 2 ϑ k h k , where h 1 , h 2 , , h k are positive integers and ϑ 1 , ϑ 2 , , ϑ k are distinct primes, then j 1 is in p r i m e   d e c o p o s i t i o n .
Lemma 2.1 
([4]). “If s 1 = ξ 1 h 1 ξ 2 h 2 ξ k h k is a prime decomposition of s 1 , then τ ( s 1 ) = ( h 1 + 1 ) ( h 2 + 1 ) ( h k + 1 ) " .
Let j 1 , j 2 , , j k be the proper divisors of n. For 1 i k , consider the following sets
A j i = { x Z n : ( x , n ) = j i } .
Moreover, observe that for i s , A j i A j s = . As a result, the vertex set of W Γ ( Z n ) has a partition formed by the sets A j 1 , A j 2 , , A j k . V ( W Γ ( Z n ) ) = A j 1 A j 2 A j k , as a result. The following lemma provides information about the cardinality of each A j i .
Lemma 2.2 
([15] [Lemma 2.1). ] “ Let j i be the proper divisor of n then | A j i | = ϕ ( n j i ) for 1 i k ”.
Lemma 2.3 
([13]). Let n be represented as n = l 1 l 2 l m w 1 s 1 w 2 s 2 w i s i where l i s , w i s are distinct primes and i 0 , s i 2 and m 1 . Then, consider the set of suitable divisors of n, denoted as { j 1 , j 2 , , j k } . If j r { l 1 , l 2 , , l m } then the induced sub-graph of W Γ ( Z n ) by A j r is K ¯ ϕ ( n j r ) .
Corollary 2.1 
([13]). Let j t be the proper divisor of positive integer n . The following assertions are true:
(1)
For t { 1 , 2 , , s } , the induced subgraph W Γ ( A j t ) of W Γ ( Z n ) , formed by the vertices in the set A j t is take two forms: either K ¯ ϕ ( n j t ) or K ϕ ( n j t ) .
(2)
For t , q { 1 , 2 , , s } and t q , a vertex within A j t is connected to either all or none of the vertices in A j q in the graph W Γ ( Z n ) .
The sub-graphs W Γ ( A j t ) created within the structure of W Γ ( Z n ) can be classified as either complete graphs or empty graphs, as shown by the previously noted Corollary 2.1 . The graph δ n * is created as a complete graph by utilizing the set of all suitable divisors of n, represented by the notation { j 1 , j 2 , , j s }.
Lemma 2.4 
([13]). W Γ ( Z n ) = δ n * [ W Γ ( A j 1 ) , W Γ ( A j 2 ) , , W Γ ( A j s ) ] w h e r e j 1 , j 2 , , j s are all the proper divisors of n.
The following theorem provides the generalized join graph’s D α spectrum in terms of the spectrum of adjacency matrix of regular graphs.
Theorem 2.2 
([2]). Let H be a connected graph of order s . Let α [ 0 , 1 ] . If, for i = 1 , 2 , , s , G i is a r i -regular graph of order m i , then the D α spectrum of the H-join graphs G 1 , G 2 , , G s is
σ D α G = i = 1 s σ M i ( α ) { μ i ( α ) } σ ( Y ) ,
where
Y = μ 1 ( α ) δ d 1 , 2 m 1 m 2 δ d 1 , s m 1 m s δ d 2 , 1 m 2 m 1 μ 2 ( α ) δ d 2 , s m 2 m s δ d s , 1 m s m 1 δ d s , 2 m s m 2 μ s ( α ) .
Here δ = ( 1 α ) , σ ( M i ( α ) ) = α T r ( v ) + ( 1 α ) ( 2 ( m i 1 ) r i ) , α T r ( v ) ( 1 α ) ( 2 + λ m i ( A ( G i ) ) ) , , α T r ( v ) ( 1 α ) ( 2 + λ 2 ( A ( G i ) ) ) , μ i ( α ) = α T r ( v ) + ( 1 α ) ( 2 ( m i 1 ) r i ) , T r ( v ) = 2 ( m i 1 ) r i + j = 1 j i s m j d i , j and d i , j are distance from vertex i to j for 1 i , j s .

3. Methodology

Research in graph theory continues to flourish because it provides a link between discrete structures and pure as well as applied mathematics. Using sophisticated mathematical tools, the study’s method builds upon well-established ideas in algebra and graph theory to produce new results. Our efforts rely on using the content of existing research to expand on established findings and investigate fresh aspects of weakly zero-divisor graphs.
The analysis in this paper heavily relies on the use of matrix theory and linear algebra. In particular, spectral graph theory provides a strong framework for studying the interaction between algebraic and graph-theoretical characteristics. A crucial tool for capturing the structural features of the weakly zero-divisor graph of the ring Z n .
The primary objective of this study is to analyze the D α spectra of the weakly zero-divisor graph W Γ ( Z n ) for a general class of n, n = ϑ 1 ϑ 2 ϑ t η 1 d 1 η 2 d 2 η s d s ( d i 2 , t 1 , s 0 ) where ϑ i ’s and η i ’s are the distinct primes. To achieve this, we use the concept of new results on the D α - matrix of connected graphs, which was introduced by Diaz et al. [2].

4. Results

We will prove the main results of this paper in this section. For r { 1 , 2 , , k } , the induced subgraph W Γ ( A j r ) of W Γ ( Z n ) , formed by the vertices in the set A j r is either K ¯ ϕ ( n j r ) or K ϕ ( n j r ) . Recall that the adjacency spectrum of complete graph K l and its complement graph K l ¯ on l vertices is given by
σ ( K l ) = l 1 1 1 l 1 and σ ( K l ¯ ) = 0 l
respectively.
Lemma 4.1. 
Let n be the product of two different primes ϑ 1 and ϑ 2 . Then, the graph W Γ ( Z n ) ’s D α spectrum is given by
σ ( D α ( W Γ ( Z ϑ 1 ϑ 2 ) ) ) = 2 α ϑ 2 + α ϑ 1 3 α 2 2 α ϑ 1 + α ϑ 2 3 α 2 ϑ 2 2 ϑ 1 2 .
The remaining two, D α eigenvalues of the graph W Γ ( Z n ) are the roots of the characteristic polynomial λ 2 λ ( α ϑ 1 + α ϑ 2 + 2 ϑ 1 + 2 ϑ 2 2 α 8 ) + α 2 ϑ 1 ϑ 2 α 2 ϑ 1 α 2 ϑ 2 + α 2 + 2 α ϑ 1 2 6 α ϑ 1 + 2 α ϑ 2 2 6 α ϑ 2 + 8 α δ 2 ϑ 1 ϑ 2 + δ 2 ϑ 1 + δ 2 ϑ 2 δ 2 + 4 ϑ 1 ϑ 2 8 ϑ 1 8 ϑ 2 + 16 = 0 .
Proof. 
The proper divisors of n are ϑ 1 and ϑ 2 and ϑ 1 < ϑ 2 . Also, by the definition of δ n * ; ϑ 1 ϑ 2 . Now by Lemma 2.4, we have W Γ ( Z ϑ 1 ϑ 2 ) = δ ϑ 1 ϑ 2 * [ W Γ ( A ϑ 1 ) , W Γ ( A ϑ 2 ) ] . Therefore, by Lemma 2.2 and Corollary 2.1, we have W Γ ( A ϑ 1 ) = K ¯ ϕ ( ϑ 2 ) and W Γ ( A ϑ 2 ) = K ¯ ϕ ( ϑ 1 ) . Therefore, by Theorem 2.2, the D α spectrum of the graph W Γ ( Z ϑ 1 ϑ 2 ) is
2 α ϑ 2 + α ϑ 1 3 α 2 2 α ϑ 1 + α ϑ 2 3 α 2 ϑ 2 2 ϑ 1 2 σ α ( Y )
and the root of characteristic polynomial λ 2 λ ( α ϑ 1 + α ϑ 2 + 2 ϑ 1 + 2 ϑ 2 2 α 8 ) + α 2 ϑ 1 ϑ 2 α 2 ϑ 1 α 2 ϑ 2 + α 2 + 2 α ϑ 1 2 6 α ϑ 1 + 2 α ϑ 2 2 6 α ϑ 2 + 8 α δ 2 ϑ 1 ϑ 2 + δ 2 ϑ 1 + δ 2 ϑ 2 δ 2 + 4 ϑ 1 ϑ 2 8 ϑ 1 8 ϑ 2 + 16 = 0 of the matrix provided below, can be used to determine the remaining two eigenvalues
Y = α ϑ 1 + 2 ϑ 2 α 4 δ ( ϑ 1 1 ) ( ϑ 2 1 ) δ ( ϑ 1 1 ) ( ϑ 2 1 ) α ϑ 2 + 2 ϑ 1 α 4
where δ = ( 1 α ) . □
Theorem 4.1. 
For distinct prime ϑ 1 , ϑ 2 , ϑ 3 and n = ϑ 1 ϑ 2 ϑ 3 , the D α spectrum of the W Γ ( Z n ) is
α | V | 1 α ( ϕ ( ϑ 2 ϑ 3 ) ) + α | V | 2 α ( ϕ ( ϑ 1 ϑ 3 ) ) + α | V | 2 A ϕ ( ϑ 1 ) + ϕ ( ϑ 2 ) + ϕ ( ϑ 3 ) 3 ϕ ( ϑ 2 ϑ 3 ) 1 ϕ ( ϑ 1 ϑ 3 ) 1 ϕ ( ϑ 1 ϑ 2 ) 1
where A = α ( ϕ ( ϑ 1 ϑ 2 ) ) + α | V | 2 and the cardinality | V | of the vertex set V of W Γ ( Z ϑ 1 ϑ 2 ϑ 3 ) is given by ϕ ( ϑ 1 ) + ϕ ( ϑ 2 ) + ϕ ( ϑ 3 ) + ϕ ( ϑ 1 ϑ 2 ) + ϕ ( ϑ 1 ϑ 3 ) + ϕ ( ϑ 2 ϑ 3 ) . The remaining six, D α eigenvalues of the graph W Γ ( Z n ) are the eigenvalues of the matrix (3).
Proof. 
Let n = ϑ 1 ϑ 2 ϑ 3 , where ϑ 1 < ϑ 2 < ϑ 3 , note that δ ϑ 1 ϑ 2 ϑ 3 * is complete graph on vertices { ϑ 1 , ϑ 2 , ϑ 3 , ϑ 1 ϑ 2 , ϑ 1 ϑ 3 , ϑ 2 ϑ 3 } . Now, by Lemma 2.4, we have,
W Γ ( Z ϑ 1 ϑ 2 ϑ 3 ) = δ ϑ 1 ϑ 2 ϑ 3 * [ W Γ ( A ϑ 1 ) , W Γ ( A ϑ 2 ) , W Γ ( A ϑ 3 ) , W Γ ( A ϑ 1 ϑ 2 ) , W Γ ( A ϑ 1 ϑ 3 ) , W Γ ( A ϑ 2 ϑ 3 ) ] .
Therefore, by Lemma 2.2 and Corollary 2.1, we have W Γ ( A ϑ 1 ) = K ¯ ϕ ( ϑ 2 ϑ 3 ) , W Γ ( A ϑ 2 ) = K ¯ ϕ ( ϑ 1 ϑ 3 ) , W Γ ( A ϑ 3 ) = K ¯ ϕ ( ϑ 1 ϑ 2 ) , W Γ ( A ϑ 1 ϑ 3 ) = K ϕ ( ϑ 2 ) and W Γ ( A ϑ 2 ϑ 3 ) = K ϕ ( ϑ 1 ) .
The cardinality | V | of the vertex set V of W Γ ( Z ϑ 1 ϑ 2 ϑ 3 ) is given by ϕ ( ϑ 1 ) + ϕ ( ϑ 2 ) + ϕ ( ϑ 3 ) + ϕ ( ϑ 1 ϑ 2 ) + ϕ ( ϑ 1 ϑ 3 ) + ϕ ( ϑ 2 ϑ 3 ) . Also we have m 1 = ϕ ( ϑ 2 ϑ 3 ) , m 2 = ϕ ( ϑ 1 ϑ 3 ) , m 3 = ϕ ( ϑ 1 ϑ 2 ) , m 4 = ϕ ( ϑ 3 ) , m 5 = ϕ ( ϑ 2 ) and m 6 = ϕ ( ϑ 1 ) . It follows that r i = 0 , r 4 = ϕ ( ϑ 3 ) 1 , r 5 = ϕ ( ϑ 2 ) 1 and r 6 = ϕ ( ϑ 1 ) 1 for 1 i 3 . Therefore, by Theorem 2.2, the D α spectrum of the graph W Γ ( Z ϑ 1 ϑ 2 ϑ 3 ) is
α | V | 1 α ( ϕ ( ϑ 2 ϑ 3 ) ) + α | V | 2 α ( ϕ ( ϑ 1 ϑ 3 ) ) + α | V | 2 A ϕ ( ϑ 1 ) + ϕ ( ϑ 2 ) + ϕ ( ϑ 3 ) 3 ϕ ( ϑ 2 ϑ 3 ) 1 ϕ ( ϑ 1 ϑ 3 ) 1 ϕ ( ϑ 1 ϑ 2 ) 1
where A = α ( ϕ ( ϑ 1 ϑ 2 ) ) + α | V | 2 . And the matrix’s characteristic polynomial can be used to determine the remaining six eigenvalues,
Y = A δ β γ δ ξ β δ β C δ β B δ β A δ γ β B δ γ ξ δ γ C δ γ B δ γ A δ ξ β δ ξ γ C δ ξ C δ ξ B δ ξ A δ C β δ C γ δ C ξ D δ C B δ A C δ B β δ B γ δ B ξ δ B C E δ A B δ A β δ A γ δ A ξ δ A C δ A B F
where A = α | V | ϕ ( ϑ 2 ϑ 3 ) ( α 2 ) 2 , B = α | V | ϕ ( ϑ 1 ϑ 3 ) ( α 2 ) 2 , C = α | V | ϕ ( ϑ 1 ϑ 2 ) ( α 2 ) 2 , D = α | V | ϕ ( ϑ 3 ) ( α 1 ) 1 , E = α | V | ϕ ( ϑ 2 ) ( α 1 ) 1 , F = α | V | ϕ ( ϑ 1 ) ( α 1 ) 1 , ξ = ϕ ( ϑ 1 ϑ 2 ) , β = ϕ ( ϑ 2 ϑ 3 ) , γ = ϕ ( ϑ 1 ϑ 3 ) , C = ϕ ( ϑ 3 ) , B = ϕ ( ϑ 2 ) , A = ϕ ( ϑ 1 ) and δ = ( 1 α ) .
Theorem 4.2. 
Let n = ϑ 1 K where K = 2 j , ϑ 1 is a prime and j 3 is a positive integer. Then, the D α spectrum of the graph W Γ ( Z ϑ 1 2 j ) consists of eigenvalue α | V | 1 with multiplicity ϑ 1 2 j 1 2 j where | V | = i = 1 2 j 1 ϕ ( ϑ 1 i ) . The other remained 2 j 1 , D α eigenvalues of the graph W Γ ( Z ϑ 1 2 j ) are eigenvalues of the matrix’s (4).
Proof. 
For n = ϑ 1 2 j , where j is a positive integer and ϑ 1 is a prime, the proper divisors of ϑ 1 2 j are ϑ 1 , ϑ 1 2 , ϑ 1 3 , , ϑ 1 j 1 , ϑ 1 j , ϑ 1 j + 1 , , ϑ 1 2 j 2 , ϑ 1 2 j 1 . By Lemma 2.4, we have
W Γ ( Z ϑ 2 j ) = δ ϑ 1 2 j * [ W Γ ( A ϑ 1 ) , W Γ ( A ϑ 1 2 ) , , W Γ ( A ϑ 1 j ) , , W Γ ( A ϑ 1 2 j 2 ) , W Γ ( A ϑ 1 2 j 1 ) ] .
It follows that | V | = i = 1 2 j 1 ϕ ( ϑ 1 i ) , where | V | is the cardinality of vertex set V of W Γ ( Z ϑ 1 2 j ) . Therefore, by Lemma 2.2 and Corollary 2.1, we get
W Γ ( Z ϑ 1 2 j ) = δ ϑ 1 2 j * [ K ϕ ( ϑ 1 2 j 1 ) , K ϕ ( ϑ 1 2 j 2 ) , , , K ϕ ( ϑ 1 j + 1 ) , K ϕ ( ϑ 1 j ) , , K ϕ ( ϑ 1 2 ) , K ϕ ( ϑ 1 ) ] .
Value of m i = ϕ ( ϑ 1 2 j i ) and r i = ϕ ( ϑ 1 2 j i ) 1 for i = 1 , 2 , 3 , , 2 j 2 , 2 j 1 . Therefore, by Theorem 2.2, the D α spectrum of the graph W Γ ( Z ϑ 1 2 j ) is consist of eigenvalue α | V | 1 with multiplicity ϑ 1 2 j 1 2 j . And the roots of the matrix’s (4) characteristic polynomial, can be used to determine the remained 2 j 1 eigenvalues,
P δ ϕ ( ϑ 1 2 j 1 ) ϕ ( ϑ 1 2 j 2 ) δ ϕ ( ϑ 1 2 j 1 ) ϕ ( ϑ 1 j ) δ ϕ ( ϑ 1 2 j 1 ) ϕ ( ϑ 1 2 ) δ ϕ ( ϑ 1 2 j 1 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 2 j 1 ) ϕ ( ϑ 1 2 j 2 ) Q δ ϕ ( ϑ 1 2 j 2 ) ϕ ( ϑ 1 j ) δ ϕ ( ϑ 1 2 j 2 ) ϕ ( ϑ 1 2 ) δ ϕ ( ϑ 1 2 j 2 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 2 j 1 ) ϕ ( ϑ 1 j ) δ ϕ ( ϑ 1 2 j 2 ) ϕ ( ϑ 1 j ) R δ ϕ ( ϑ 1 j ) ϕ ( ϑ 1 2 ) δ ϕ ( ϑ 1 j ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 2 j 1 ) ϕ ( ϑ 1 2 ) δ ϕ ( ϑ 1 2 j 2 ) ϕ ( ϑ 1 2 ) δ ϕ ( ϑ 1 j ) ϕ ( ϑ 1 2 ) S δ ϕ ( ϑ 1 2 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 2 j 1 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 2 j 2 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 j ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 2 ) ϕ ( ϑ 1 ) T
where P = α | V | ϕ ( ϑ 1 2 j 1 ) ( α 1 ) 1 , Q = α | V | ϕ ( ϑ 1 2 j 2 ) ( α 1 ) 1 , R = α | V | ϕ ( ϑ 1 j ) ( α 1 ) 1 , S = α | V | ϕ ( ϑ 1 2 ) ( α 1 ) 1 , T = α | V | ϕ ( ϑ 1 ) ( α 1 ) 1 , | V | = i = 1 2 j 1 ϕ ( ϑ 1 i ) , and δ = 1 α .
Theorem 4.3. 
Let n = ϑ 1 K where K = 2 j + 1 , ϑ 1 is a prime and j 3 is a positive integer. Then, D α spectrum of the graph W Γ ( Z ϑ 1 2 j + 1 ) consists of eigenvalue α | V | 1 with multiplicity ϑ 1 2 j ( 2 j + 1 ) . The other remained 2 j , D α eigenvalues of the graph W Γ ( Z ϑ 1 2 j + 1 ) are eigenvalues of the matrix’s (5).
Proof. 
Similarly as above Theorem 4.2, we can proof that the D α spectrum of the graph W Γ ( Z ϑ 1 2 j + 1 ) consists of eigenvalue α | V | 1 with multiplicities ϑ 1 2 j ( 2 j + 1 ) , | V | = i = 1 2 j ϕ ( ϑ 1 i ) , where | V | is the cardinality of vertex set V of W Γ ( Z ϑ 1 2 j + 1 ) . The other remained 2 j , D α eigenvalues of the graph W Γ ( Z ϑ 1 2 j + 1 ) are eigenvalues of the matrix’s (5),
P δ ϕ ϑ 1 2 j ϕ ϑ 1 2 j 1 δ ϕ ϑ 1 2 j ϕ ϑ 1 j δ ϕ ϑ 1 2 j ϕ ϑ 1 2 δ ϕ ϑ 1 2 j ϕ ϑ 1 δ ϕ ϑ 1 2 j ϕ ϑ 1 2 j 1 Q δ ϕ ϑ 1 2 j 1 ϕ ϑ 1 j δ ϕ ϑ 1 2 j 1 ϕ ϑ 1 2 δ ϕ ϑ 1 2 j 1 ϕ ϑ 1 δ ϕ ϑ 1 2 j ϕ ϑ 1 j δ ϕ ϑ 1 2 j 1 ϕ ϑ 1 j R δ ϕ ϑ 1 j ϕ ϑ 1 2 δ ϕ ϑ 1 j ϕ ϑ 1 δ ϕ ϑ 1 2 j ϕ ϑ 1 2 δ ϕ ϑ 1 2 j 1 ϕ ϑ 1 2 δ ϕ ϑ 1 j ϕ ϑ 1 2 S δ ϕ ϑ 1 2 ϕ ϑ 1 δ ϕ ϑ 1 2 j ϕ ϑ 1 δ ϕ ϑ 1 2 j 1 ϕ ϑ 1 δ ϕ ϑ 1 j ϕ ϑ 1 δ ϕ ϑ 1 2 ϕ ϑ 1 T
where P = α | V | ϕ ( ϑ 1 2 j ) ( α 1 ) 1 , Q = α | V | ϕ ( ϑ 1 2 j 1 ) ( α 1 ) 1 , R = α | V | ϕ ( ϑ 1 j ) ( α 1 ) 1 , S = α | V | ϕ ( ϑ 1 2 ) ( α 1 ) 1 , T = α | V | ϕ ( ϑ 1 ) ( α 1 ) 1 , | V | = i = 1 2 j ϕ ( ϑ 1 i ) and δ = 1 α .
If j = 3 in Theorem 4.2, the resulting outcome gives the D α spectrum of W Γ ( Z n ) .
Corollary 4.1. 
The D α spectrum of W Γ ( Z n ) for n = ϑ 1 6 , consists of eigenvalue α ( ϑ 1 5 1 ) 1 with multiplicity ϑ 1 5 6 . The other remained 5, D α eigenvalues of the graph W Γ ( Z ϑ 1 6 ) are eigenvalues of the matrix’s 6,
μ 1 ( α ) δ ϑ 1 3 ( ϑ 1 1 ) ϑ 1 δ ϑ 1 3 ( ϑ 1 1 ) δ ϑ 1 2 ( ϑ 1 1 ) ϑ 1 δ ϑ 1 2 ( ϑ 1 1 ) δ ϑ 1 3 ( ϑ 1 1 ) ϑ 1 μ 2 ( α ) δ ϑ 1 2 ( ϑ 1 1 ) ϑ 1 δ ϑ 1 2 ( ϑ 1 1 ) δ ϑ 1 ( ϑ 1 1 ) ϑ 1 δ ϑ 1 3 ( ϑ 1 1 ) δ ϑ 1 2 ( ϑ 1 1 ) ϑ 1 μ 3 ( α ) δ ϑ 1 ( ϑ 1 1 ) ϑ 1 δ ϑ 1 ( ϑ 1 1 ) δ ϑ 1 2 ( ϑ 1 1 ) ϑ 1 δ ϑ 1 2 ( ϑ 1 1 ) δ ϑ 1 ( ϑ 1 1 ) ϑ 1 μ 4 ( α ) δ ( ϑ 1 1 ) ϑ 1 δ ϑ 1 2 ( ϑ 1 1 ) δ ϑ 1 ( ϑ 1 1 ) ϑ 1 δ ϑ 1 ( ϑ 1 1 ) δ ( ϑ 1 1 ) ϑ 1 μ 5 ( α ) .
Where μ 1 ( α ) = ϑ 1 4 ( α 1 ) + ϑ 1 5 ( α + 1 ) , μ 2 ( α ) = α ϑ 1 5 + ϑ 1 4 ( 1 α ) + ϑ 1 3 ( α 1 ) ( α + 1 ) , m u 3 ( α ) = α ϑ 1 5 + ϑ 1 3 ( 1 α ) + ϑ 1 2 ( α 1 ) ( α + 1 ) , μ 4 ( α ) = α ϑ 1 5 + ϑ 1 2 ( 1 α ) + ϑ 1 ( α 1 ) ( α + 1 ) , μ 5 ( α ) = α ϑ 1 5 + ϑ 1 ( 1 α ) 2 and δ = 1 α .
Theorem 4.4. 
For distinct primes ϑ 1 , ϑ 2 and n = ϑ 1 t ϑ 2 , t 2 . The D α spectrum of the W Γ ( Z n ) consists of eigenvalues,
α | V | 1 α ( ϕ ( ϑ 1 t ) ) + α | V | 2 k = 1 t ϕ ( ϑ 1 t k ϑ 2 ) + k = 1 t 1 ϕ ( ϑ 1 k ) ( 2 t 1 ) ϕ ( ϑ 1 t ) 1 .
The cardinality | V | of the vertex set V of W Γ ( Z ϑ 1 t ϑ 2 ) is given by k = 1 t ϕ ( ϑ 1 k ) + k = 0 t 1 ϕ ( ϑ 1 k ϑ 2 ) and the roots of characteristic polynomial of the matrix (7) provides the remaining 2 t eigenvalues.
Proof. 
Let n = ϑ 1 t ϑ 2 , where ϑ 1 < ϑ 2 , note that δ ϑ 1 t ϑ 2 * is complete graph on vertices { ϑ 1 , ϑ 1 2 , , ϑ 1 t , ϑ 2 , ϑ 1 ϑ 2 , ϑ 1 2 ϑ 2 , , ϑ 1 t 1 ϑ 2 } . By lemma 2.4, we have
W Γ ( Z ϑ 1 t ϑ 2 ) = δ ϑ 1 t ϑ 2 * [ W Γ ( A ϑ 1 ) , , W Γ ( A ϑ 1 t ) , W Γ ( A ϑ 2 ) , W Γ ( A ϑ 1 ϑ 2 ) , , , W Γ ( A ϑ 1 t 1 ϑ 2 ) ] .
Therefore, by Lemma 2.2 and Corollary 2.1, we get
W Γ ( Z ϑ 1 t ϑ 2 ) = δ ϑ 1 t ϑ 2 * [ K ϕ ( ϑ 1 t 1 ϑ 2 ) , , K ϕ ( ϑ 2 ) , K ¯ ϕ ( ϑ 1 t ) , K ϕ ( ϑ 1 t 1 ) , , K ϕ ( ϑ 1 ) ] .
Consequently, the cardinality | V | of the vertex set V of W Γ ( Z ϑ 1 t ϑ 2 ) is given by k = 1 t ϕ ( ϑ 1 k ) + k = 0 t 1 ϕ ( ϑ 1 k ϑ 2 ) and also m ϑ 1 = ϕ ( ϑ 1 t 1 ϑ 2 ) , m ϑ 1 2 = ϕ ( ϑ 1 t 2 ϑ 2 ) , , m ϑ 1 t = ϕ ( ϑ 2 ) , m ϑ 1 ϑ 2 = ϕ ( ϑ 1 t 1 ) , , m ϑ 1 r ϑ 2 = ϕ ( ϑ 1 t r ) , , m ϑ 1 t 1 ϑ 2 = ϕ ( ϑ 1 ) and m ϑ 2 = ϕ ( ϑ 1 t ) . And it follows that r ϑ 1 = ϕ ( ϑ 1 t 1 ϑ 2 ) 1 , r ϑ 1 2 = ϕ ( ϑ 1 t 2 ϑ 2 ) 1 , , r ϑ 1 t = ϕ ( ϑ 2 ) 1 , r ϑ 1 ϑ 2 = ϕ ( ϑ 1 t 1 ) 1 , , r ϑ 1 r ϑ 2 = ϕ ( ϑ 1 t r ) 1 , , r ϑ 1 t 1 ϑ 2 = ϕ ( ϑ 1 ) 1 and r ϑ 2 = 0 . Therefore, by Theorem 2.2, the D α spectrum of the graph W Γ ( Z ϑ 1 t ϑ 2 ) is
σ ( D α ( W Γ ( Z ϑ 1 t ϑ 2 ) ) ) = α | V | 1 α ( ϕ ( ϑ 1 t ) ) + α | V | 2 k = 1 t ϕ ( ϑ 1 t k ϑ 2 ) + k = 1 t 1 ϕ ( ϑ 1 k ) ( 2 t 1 ) ϕ ( ϑ 1 t ) 1 σ α ( Y ) .
And the roots of the matrix’s (7) characteristic polynomial, can be used to determine the remaining eigenvalues Y =
a δ m ϑ 1 m ϑ 1 t δ m ϑ 1 m ϑ 2 δ m ϑ 1 m ϑ 1 ϑ 2 δ m ϑ 1 m ϑ 1 t 1 ϑ 2 δ m ϑ 1 m ϑ 1 2 δ m ϑ 1 2 m ϑ 1 t δ m ϑ 1 2 m ϑ 2 δ m ϑ 1 2 m ϑ 1 ϑ 2 δ m ϑ 1 2 m ϑ 1 t 1 ϑ 2 δ m ϑ 1 m ϑ 1 t b δ m ϑ 2 m ϑ 1 t δ m ϑ 1 ϑ 2 m ϑ 1 t δ m ϑ 1 t 1 ϑ 2 m ϑ 1 t δ m ϑ 1 m ϑ 2 δ m ϑ 1 t m ϑ 2 c δ m ϑ 1 ϑ 2 m ϑ 2 δ m ϑ 2 m ϑ 1 t 1 ϑ 2 δ m ϑ 1 m ϑ 1 ϑ 2 δ m ϑ 1 ϑ 2 m ϑ 1 t δ m ϑ 2 m ϑ 1 ϑ 2 d δ m ϑ 1 ϑ 2 m ϑ 1 t 1 ϑ 2 δ m ϑ 1 m ϑ 1 t 1 ϑ 2 δ m ϑ 1 t 1 ϑ 2 m ϑ 1 t δ m ϑ 1 t 1 ϑ 2 m ϑ 2 δ m ϑ 1 t 1 ϑ 2 m ϑ 1 ϑ 2 e
where a = α | V | ϕ ( ϑ 1 t 1 ϑ 2 ) ( α 1 ) 1 , b = α | V | ϕ ( ϑ 2 ) ( α 1 ) 1 , c = α | V | ϕ ( ϑ 1 t ) ( α 2 ) 2 , d = α | V | ϕ ( ϑ 1 t 1 ) ( α 1 ) 1 , e = α | V | ϕ ( ϑ 1 ) ( α 1 ) 1 , | V | = k = 1 t ϕ ( ϑ 1 k ) + k = 0 t 1 ϕ ( ϑ 1 k ϑ 2 ) and δ = ( 1 α ) .
When we choose t = 2 in Theorem 4.4, the conclusion can be derived.
Corollary 4.2. 
For distinct primes ϑ 1 , ϑ 2 and n = ϑ 1 2 ϑ 2 , the D α spectrum of the graph W Γ ( Z n ) is given by
σ ( D α ( W Γ ( Z ϑ 1 2 ϑ 2 ) ) ) = α | V | 1 α | V | + α ϕ ( ϑ 1 2 ) 2 ϕ ( ϑ 1 ϑ 2 ) + ϕ ( ϑ 1 ) + ϕ ( ϑ 2 ) 3 ϕ ( ϑ 1 2 ) 1 .
The cardinality | V | of the vertex set V of W Γ ( Z ϑ 1 2 ϑ 2 ) is given by ϕ ( ϑ 1 ϑ 2 ) + ϕ ( ϑ 1 2 ) + ϕ ( ϑ 2 ) + ϕ ( ϑ 1 ) and the remaining four, D α eigenvalues of the graph W Γ ( Z n ) are the eigenvalues of the matrix (8).
Proof. 
Let n = ϑ 1 2 ϑ 2 , where ϑ 1 < ϑ 2 , note that δ ϑ 1 2 ϑ 2 * is complete graph on vertices { ϑ 1 , ϑ 2 , ϑ 1 2 , ϑ 1 ϑ 2 } . By Lemma 2.4, we have W Γ ( Z ϑ 1 2 ϑ 2 ) = δ ϑ 1 2 ϑ 2 * [ W Γ ( A ϑ 1 ) , W Γ ( A ϑ 2 ) , W Γ ( A ϑ 1 2 ) , W Γ ( A ϑ 1 ϑ 2 ) ] . Therefore, by Lemma 2.2 and Corollary 2.1, we have W Γ ( A ϑ 1 ) = K ϕ ( ϑ 1 ϑ 2 ) , W Γ ( A ϑ 2 ) = K ¯ ϕ ( ϑ 1 2 ) , W Γ ( A ϑ 1 2 ) = K ϕ ( ϑ 2 ) and W Γ ( A ϑ 1 ϑ 2 ) = K ϕ ( ϑ 1 ) .
The cardinality | V | of the vertex set V of W Γ ( Z ϑ 1 2 ϑ 2 ) is given by ϕ ( ϑ 1 ϑ 2 ) + ϕ ( ϑ 1 2 ) + ϕ ( ϑ 2 ) + ϕ ( ϑ 1 ) and m 1 = ϕ ( ϑ 1 ϑ 2 ) , m 2 = ϕ ( ϑ 1 2 ) , m 3 = ϕ ( ϑ 2 ) , m 4 = ϕ ( ϑ 1 ) . It follows that, r 1 = ϕ ( ϑ 1 ϑ 2 ) 1 , r 2 = 0 , r 3 = ϕ ( ϑ 2 ) 1 and r 4 = ϕ ( ϑ 1 ) 1 . Therefore, by Theorem 2.2, the D α spectrum of the graph W Γ ( Z ϑ 1 2 ϑ 2 ) is
α | V | 1 α | V | + α ϕ ( ϑ 1 2 ) 2 ϕ ( ϑ 1 ϑ 2 ) + ϕ ( ϑ 1 ) + ϕ ( ϑ 2 ) 3 ϕ ( ϑ 1 2 ) 1 σ α ( Y ) .
And the matrix’s characteristic polynomial of matrix given in (8), can be used to determine the remaining four eigenvalues,
Y = A δ ϕ ( ϑ 1 ϑ 2 ) ϕ ( ϑ 1 2 ) δ ϕ ( ϑ 1 ϑ 2 ) ϕ ( ϑ 2 ) δ ϕ ( ϑ 1 ϑ 2 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 2 ) ϕ ( ϑ 1 ϑ 2 ) B δ ϕ ( ϑ 1 2 ) ϕ ( ϑ 2 ) δ ϕ ( ϑ 1 2 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 2 ) ϕ ( ϑ 1 ϑ 2 ) δ ϕ ( ϑ 2 ) ϕ ( ϑ 1 2 ) C δ ϕ ( ϑ 2 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 ) ϕ ( ϑ 1 ϑ 2 ) δ ϕ ( ϑ 1 2 ) ϕ ( ϑ 1 ) δ ϕ ( ϑ 1 ) ϕ ( ϑ 2 ) D
where δ = ( 1 α ) , A = α | V | ϕ ( ϑ 1 ϑ 2 ) ( α 1 ) 1 , B = α | V | ϕ ( ϑ 1 2 ) ( α 2 ) 2 , C = α | V | ϕ ( ϑ 2 ) ( α 1 ) 1 and D = α | V | ϕ ( ϑ 1 ) ( α 1 ) 1 .
Example 4.1. 
The D α spectrum of the weakly zero-divisor graph of Z 20 is
σ ( D α ( W Γ ( Z 20 ) ) ) = 11 α 1 13 α 2 6 1 .
The remaining four D α eigenvalues of the graph W Γ ( Z 20 ) are the roots of characteristic polynomial of the matrix (9).
Figure 1. Weakly zero-divisor graph W Γ ( Z 20 ) .
Figure 1. Weakly zero-divisor graph W Γ ( Z 20 ) .
Preprints 154491 g001
Figure 2. Proper divisor graph δ 20 * .
Figure 2. Proper divisor graph δ 20 * .
Preprints 154491 g002
From Corollary 4.2, the D α spectrum of the graph W Γ ( Z 20 ) is given by
σ α ( W Γ ( Z 20 ) ) = 11 α 1 13 α 2 6 1 σ α ( Y ) .
And the roots of characteristic polynomial of the matrix (9) provided below, are remaining four D α eigenvalues of the graph W Γ ( Z 20 ) ,
Y = 3 + 7 α 2 δ 2 4 2 δ 2 δ 2 9 α + 2 2 δ 2 δ 2 4 2 δ 2 3 + 7 α 2 δ 2 δ δ 2 2 δ 10 α
where δ = ( 1 α ) .
Theorem 4.5. 
Let n = ϑ 1 ϑ 2 ϑ 3 ϑ t η 1 d 1 η 2 d 2 η s d s ( d i 2 , t 1 , s 0 ) where ϑ i ’s and η i ’s are the distinct primes. Then, the D α spectrum of the W Γ ( Z n ) consists of eigenvalues,
α | V | 1 α ϕ n θ 1 + α | V | 2 α ϕ n 2 + α | V | 2 α ϕ n 3 + α | V | 2 c i ϑ i ϕ n c i ( τ ( n ) 2 t ) ϕ n 1 1 ϕ n 2 1 ϕ n 3 1 α ϕ n t t 1 + α | V | 2 α ϕ n t t + α | V | 2 ϕ n t t 1 1 ϕ n t t 1 .
The cardinality | V | of the vertex set V of the graph W Γ ( Z n ) is given by, | V | = i = 1 τ ( n ) 2 ϕ ( n c i ) and the characteristic polynomial of the matrix (10) provides the other remained, eigenvalues. Also, if the eigenvalues of the matrix (10) are integers then the weakly zero divisor graph of Z n for n = ϑ 1 ϑ 2 ϑ 3 ϑ t η 1 d 1 η 2 d 2 η s d s ( d i 2 , t 1 , s 0 ) is D α integral.
Proof. 
Suppose that n = ϑ 1 ϑ 2 ϑ t η 1 d 1 η 2 d 2 η s d s ( d i 2 , t 1 , s 0 ) where ϑ i ’s and η i ’s are the distinct primes. Let β = { ϑ 1 , ϑ 2 , , ϑ t } . Then, by Lemma 2.3, the following conclusions can be drawn: for each c i β , we have W Γ ( A c i ) = K ¯ ϕ ( n c i ) and for c j β we have W Γ ( A c i ) = K ϕ ( n c i ) . The cardinality | V | of the vertex set V of the graph W Γ ( Z n ) is | V | = i = 1 τ ( n ) 2 ϕ ( n c i ) . Also note that for 1 i , j τ ( n ) 2 , we have, m c i = ϕ ( n c i ) , m c j = ϕ ( n c j ) for all c i β and c j β . Therefore, by Theorem 2.2, the D α spectrum of the graph W Γ ( Z n ) is
α | V | 1 α ϕ n θ 1 + α | V | 2 α ϕ n θ 2 + α | V | 2 α ϕ n θ 3 + α | V | 2 α ϕ n θ t 1 + α | V | 2 α ϕ n θ t + α | V | 2 c i θ i ϕ n c i ( τ ( n ) 2 t ) ϕ n θ 1 1 ϕ n θ 2 1 ϕ n θ 3 1 ϕ n θ t 1 1 ϕ n θ t 1 .
Note that all these eigenvalues are integers. And the roots of the matrix’s (10) characteristic polynomial, can be used to determine the remaining eigenvalues,
μ c 1 ( α ) δ ϕ ( n c 1 ) ϕ ( n c t ) δ ϕ ( n c 1 ) ϕ ( n c t + 1 ) δ ϕ ( n c 1 ) ϕ ( n c τ ( n ) 2 ) δ ϕ ( n c 1 ) ϕ ( n c t ) μ c t ( α ) δ ϕ ( n c t ) ϕ ( n c t + 1 ) δ ϕ ( n c t ) ϕ ( n c τ ( n ) 2 ) δ ϕ ( n c 1 ) ϕ ( n c t + 1 ) δ ϕ ( n c t ) ϕ ( n c t + 1 ) μ c t + 1 ( α ) δ ϕ ( n c t + 1 ) ϕ ( n c τ ( n ) 2 ) δ ϕ ( n c 1 ) ϕ ( n c τ ( n ) 2 ) δ ϕ ( n c t ) ϕ ( n c τ ( n ) 2 ) δ ϕ ( n c t + 1 ) ϕ ( n c τ ( n ) 2 ) μ c τ ( n ) 2 ( α )
where δ = ( 1 α ) and
μ c i ( α ) = α | V | ϕ ( n c i ) ( α 2 ) 2 , c i β α | V | ϕ ( n c i ) ( α 1 ) 1 , c i β .
If the eigenvalues of the matrix (10) are integers then the weakly zero divisor graph of Z n for n = ϑ 1 ϑ 2 ϑ 3 ϑ t η 1 d 1 η 2 d 2 η s d s ( d i 2 , t 1 , s 0 ) is D α integral. □
Example 4.2. 
The D α spectrum of the weakly zero-divisor graph of Z 42 shown in Figure 2., is
σ ( D α ( W Γ ( Z 42 ) ) ) = 29 α 1 41 α 2 35 α 2 31 α 1 6 11 5 1 .
Other six remained, D α eigenvalues of the graph W Γ ( Z 42 ) are the eigenvalues of the matrix (11).
The proper divisors of 42 are 2 , 3 , 7 , 6 , 14 and 21 . Note that δ 42 * is complete graph on vertices 2 , 3 , 7 , 6 , 14 and 21. Now by Lemma 2.4, we have W Γ ( Z 42 ) = δ 42 * [ W Γ ( A 2 ) , W Γ ( A 3 ) , W Γ ( A 7 ) , W Γ ( A 6 ) , W Γ ( A 14 ) , W Γ ( A 21 ) ] . Therefore, by Lemma 2.2 and Corollary 2.1, we have W Γ ( A 2 ) = K 12 ¯ , W Γ ( A 3 ) = K ¯ 6 , W Γ ( A 7 ) = K ¯ 2 , W Γ ( A 6 ) = K 6 , W Γ ( A 14 ) = K 2 and W Γ ( A 21 ) = K 1 . The cardinality | V | of the vertex set V of W Γ ( Z 42 ) is 19. Now according the proper divisor sequence, we have, m 1 = 12 , m 2 = 6 , m 3 = 2 , m 4 = 6 , m 5 = 2 , m 6 = 1 and further, we have r 1 = r 2 = r 3 = 0 , r 4 = 5 , r 5 = 1 and r 6 = 0 . Consequently, the D α spectrum of the graph W Γ ( Z 42 ) is given by Theorem 2.2.
σ ( D α ( W Γ ( Z 42 ) ) ) = 29 α 1 41 α 2 35 α 2 31 α 1 6 11 5 1 .
And the matrix’s characteristic polynomial, can be used to determine the remaining six eigenvalues,
Y = 17 α + 22 6 δ 2 2 δ 6 6 δ 2 2 δ 6 2 δ 3 6 δ 2 23 α + 10 2 δ 3 6 δ 2 δ 3 δ 6 2 δ 6 2 δ 3 27 α + 2 2 δ 3 2 δ δ 2 6 δ 2 6 δ 2 δ 3 23 α + 5 2 δ 3 δ 6 2 δ 6 2 δ 3 2 δ 2 δ 3 1 + 27 α δ 2 2 δ 3 δ 6 δ 2 δ 6 δ 2 28 α
where δ = ( 1 α ) .
Figure 2. Weakly zero-divisor graph W Γ ( Z 42 ) .
Figure 2. Weakly zero-divisor graph W Γ ( Z 42 ) .
Preprints 154491 g003

5. Conclusion and Further Work

In this study, we have explored the D α spectrum of the weakly zero-divisor graph W Γ ( Z n ) ) for a general class of n, where n = ϑ 1 ϑ 2 ϑ t η 1 d 1 η 2 d 2 η s d s ( d i 2 , t 1 , s 0 ) where ϑ i ’s and η i ’s are the distinct primes. For this, we use the concept of new results on the D α - matrix of connected graphs, which was introduced by Diaz et al. [2]. We obtained the D α eigenvalues for several arrangements by using thorough calculations and basic algebraic properties of the weakly zero-divisor graph. This study shows how the algebraic structure of Z n and the spectral features of its associated graph interact, building on earlier findings on particular classes of n.
The results show that the D α spectrum contains important information regarding the basic structure of weakly zero divisors. Specifically, the eigenvalue distributions and characteristic polynomials provide clarity on the modular arithmetic and divisors that underlie Z n . The findings further support the significance of spectral graph theory in algebraic contexts by validating the existence of distinctive spectral patterns in specific classes of weakly zero-divisor graphs.
This study suggests various exciting paths for further exploration. One possible direction is to broaden the spectral analysis to encompass wider categories of finite commutative rings, with the goal of uncovering more profound connections between their algebraic characteristics and spectral parameters. An additional area worth exploring involves the investigation of further graph invariants, including the spectral radius, chromatic number, and connectivity, along with their relationships to the D α spectrum of weakly zero-divisor graphs. The spectra for higher powers of primes and rings with multiple prime factors could also be analyzed using sophisticated computer approaches, which could reveal complex patterns and features. Furthermore, it is necessary to conduct thorough research since the spectrum characteristics of weakly zero-divisor graphs may have useful implications in coding theory, cryptography, and error detection systems. It may be possible to identify significant similarities and differences between weakly zero-divisor graphs and other algebraically defined graphs, such as unit graphs or co-maximal graphs, by comparing their spectral properties.
Further one can calculate D α spectrum for co-zero divisor graph, unit graph, co-maximal graph and many more such graphs. This research not only deepens the theoretical insights into weakly zero-divisor graphs but also creates a strong basis for interdisciplinary studies that combine algebra, graph theory, and computational techniques.

Author Contributions

All authors made equal contribution.

Funding

The first author is supported by a project by Princess Nourah bint Abdulrahman University (PNU), Riyadh, Saudi Arabia, with Project No. PNURSP2025R231.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Anwar, M., Mozumder, M. R., Rashid, M., Raza, M.A. Somber Index and Somber spectrum of cozero-divisor graph of Zn. Results Math. 2024, 79(4), 146.
  2. Diaz, R. C., Pasten, G., Rojo, O. New results on the Dα- matrix of connected graphs. Linear Algebra Appl. 2019, 577, 168–185. [CrossRef]
  3. Diaz, R. C., Pasten, G., Rojo, O. On the minimal spectral radius of graphs subject to fixed connectivity. Linear Algebra Appl. 2020, 584, 353–370. [CrossRef]
  4. Koshy, T. Elementary number theory with application, 2nd ed., academic press: cambridge, UK, 1985.
  5. Lin, H., Liu, X., Xue, J. Graphs determined by Aα-spectra. Discrete Math. 2019, 342, 441–450. [CrossRef]
  6. Lin, H., Xue, J., Shu, J. On the Dα-spectral radius of graphs. Linear Multilinear Algebra 2019, 62, 1563–5139.
  7. Mozumder, M. R., Rashid, M., Khan, A. I. A. Exploring Aα spectrum of the weakly zero-divisor graph of the ring Zn. Discrete Math. Algorit. Appl. 2025. [CrossRef]
  8. Nikiforov, V. Merging the A-and Q-spectral theories. Appl. Anal. Discrete Math. 2017, 12, 81–107. [Google Scholar] [CrossRef]
  9. Nikmehr, M. J., Azadi, A., Nikandish, R. The weakly zero-divisor graph of a commutative ring. Rev.Union Mat.Argent. 2021, 35, 105–116.
  10. Rashid, M., Alali, A. S., Mozumder, M. R., Ahmed, W. Spectrum of the cozero-divisor graph associated to ring Zn. Axioms 2023, 12, 957. [CrossRef]
  11. Rashid, M., Mozumder, M. R., Anwar, M. Signless Laplacian spectrum of the cozero-divisor graph of the commutative ring Zn. Georgian Math. J. 2024, 31(4), 687–699.
  12. Rashid, M., Mozumder, M. R., Ahmed, W. On signless Laplacian eigenvalues of Zn. Palestine Journal of Mathematics 2024, 13(4), 955–961.
  13. Shariq, M., Mathil, P., Kumar, J. Laplacian spectrum of weakly zero-divisor graph of the ring Zn. arXiv2023,arXiv:2307.12757.
  14. SY. Cui, JX. He, GX. Tian. The generalized distance matrix. Linear Algebra Appl. 2019, 563, 1–23. [CrossRef]
  15. Young, M. Adjacency matrices of zero-divisor graphs of integer modulo n. Involve 2015, 8, 753–761. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated