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.
Let us consider the finite commutative ring R, whose unity is Its weakly zero-divisor graph, represented as , is a basic undirected graph with two distinct vertices, and , that are adjacent if and only if there exist and that satisfy the condition . Let be the distance matrix and be the diagonal matrix of the vertex transmissions in basic undirected connected graph G. The matrix of graph G is defined as for . This article finds the spectrum for the graph for various values of n and also shows that for , where ’s and ’s are the distinct primes, is integral.
Consider a commutative ring $R$ with an identity element $1\neq0$. The set $Z(R)'$ is defined as the collection of all elements in the ring $R$ that are non-zero and non units. The undirected graph ${\Gamma'(R)}$ with vertex set $Z(R)'$, known as the cozero-divisor graph of $R$. In this graph, two distinct vertices, denoted by $x$ and $y$, are connected by an edge if and only if $x$ is not an element of the ideal $yR$ and $y$ is not an element of the ideal $xR$. In this article, we find the Laplacian eigenvalues of the graphs ${\Gamma'(\mathbb Z_n)}$ for $n=q_1^{Q}q_2q_3$ and $q_1^{Q_1}q_2^{Q_2}q_3$, where $q_1,q_2,q_3$ are distinct primes and $Q, {Q_1},{Q_2}$ are positive integers.
Let be the identity of the commutative ring R. The cozero-divisor graph of a ring R is an undirected simple graph, represented by , where two different vertices g and h are adjacent if and only if and . The vertices of this graph are given by the set of all non-zero and non-unit elements of R. The definition of a graph G’s matrix is , where is the diagonal matrix and is the adjacency matrix of graph G. In this article, we calculate the sum-connectivity F-index, product-connectivity F-index of , when , and the eigenvalues of for , where , are distinct primes.