Assessment of Distance Related Spectrum of the Zero-divisor Graph

This paper aims to find the distance, distance Laplacian and distance signless Laplacian of ,for some values of n. For a commutative ring with non-zero identity, denote the set of nonzero zero-divisors of R . The zero-divisor graph of R denoted by (R), is a simple undirected graph with all non-zero zero-divisors as vertices and two distinct vertices are adjacent if and only if xy = 0 . In this paper, the distance, distance Laplacian and the distance singless Laplacian spectrum of for n = p3 , pq are investigated. The specific combinatorial structure as well as the typical block structure of the distance related matrices of the graphs mentioned in this study both contributed to our decision to use matrices in the spectrum computation.