SEIDEL SPECTRUM OF THE ZERO-DIVISOR GRAPH ON THE RING OF INTEGERS MODULO n
The Seidel matrix of a graph G of order n is a real, symmetric, matrix in which the entry is -1 if the vertices and are adjacent and 1 if they are non-adjacent and 0 if In this paper, we investigate the Seidel spectrum of the zero-divisor graph of in terms of the spectrum of the vertex weighted combinatorial matrix of the compressed zero-divisor graph.
Seidel matrix, zero-divisor graph.
