Answers are grounded in this paper and cite their sources.
We study adjacency matrices of zero-divisor graphs of [math] for various [math] . We find their determinant and rank for all [math] , develop a method for finding nonzero eigenvalues, and use it to find all eigenvalues for the case [math] , where [math] is a prime number. We also find upper and lower bounds for the largest eigenvalue for all [math] .
No takes yet. Share an insight, caveat, or question.
Matthew Young (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: