Abstract
In this paper, we first study zero divisor graphs over finite chain rings. We determine their rank, determinant, and eigenvalues using reduction graphs. Moreover, we extend the work to zero divisor graphs over finite commutative principal ideal rings using a combinatorial method, finding the number of positive eigenvalues and the number of negative eigenvalues, and finding upper and lower bounds for the largest eigenvalue. Finally, we characterize all finite commutative principal ideal rings such that their zero divisor graphs are complete and compute the Wiener index of the zero divisor graphs over finite commutative principal ideal rings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have