The spectrum of a normal digraph


Aleksandar Torgašev




In this paper we consider the spectra of finite digraphs whose 0-1 adjacency matrix is normal but not a symmetric one. Some general properties of such diagraphs are proved, all the normal digraphs whose order is at most 5 are found, and the spectra of such digraphs calculated.