Zero-Divisor Graphs of Rings and Their Hermitian Matrices

This paper investigates the interplay between the algebraic properties of the rings, the combinatorial properties of their corresponding zero-divisor graphs, and the associated Hermitian matrix of such graphs. For a finite ring R , its zero-divisor graph may contain both directed edges and undirected edges; such graphs are called mixed graphs. The Hermitian matrices of mixed graphs are natural generalizations of the adjacency matrices of undirected graphs. In this paper, we completely determine the structure and the Hermitian eigenvalues of the zero-divisor graph Γ (D× R) by using the structure and the Hermitian eigenvalues of the zero-divisor graph Γ (R) . As applications, we investigate Γ (D× R) for some special R and extend some known results on this topic.