Open Access
2015 Adjacency matrices of zero-divisor graphs of integers modulo $n$
Matthew Young
Involve 8(5): 753-761 (2015). DOI: 10.2140/involve.2015.8.753

Abstract

We study adjacency matrices of zero-divisor graphs of n for various n. We find their determinant and rank for all n, develop a method for finding nonzero eigenvalues, and use it to find all eigenvalues for the case n = p3, where p is a prime number. We also find upper and lower bounds for the largest eigenvalue for all n.

Citation

Download Citation

Matthew Young. "Adjacency matrices of zero-divisor graphs of integers modulo $n$." Involve 8 (5) 753 - 761, 2015. https://doi.org/10.2140/involve.2015.8.753

Information

Received: 7 February 2014; Revised: 27 August 2014; Accepted: 19 September 2014; Published: 2015
First available in Project Euclid: 22 November 2017

zbMATH: 1322.05093
MathSciNet: MR3404655
Digital Object Identifier: 10.2140/involve.2015.8.753

Subjects:
Primary: 05C50 , 13M99

Keywords: ‎adjacency matrix , zero-divisor graph

Rights: Copyright © 2015 Mathematical Sciences Publishers

Vol.8 • No. 5 • 2015
MSP
Back to Top