On Eigenvalues of Complement Digraphs

Adigraph’s antiadjacency matrix is defined as its complement’s adjacency matrix. Therefore,we can distinguish the complement of digraphs by analysing the properties of their antiadjacency matrices. In this paper, our interest lies in exploring the properties of eigenvalues of the antiadjacency matrix of digraphs and establishing their relation to the characterisation of digraphs. Recent results regarding the eigenvalues of the antiadjacency matrices of certain classes of cyclic digraphs allow us to generalise the bounds of the spectral radius of a complement digraph. Additionally, we establish a connection between the bounds of the spectral radius of a complement digraph and the characterisation of the complement digraph. Since a digraph can be either cyclic or acyclic, we distinguish between the spectral radius of a cyclic and acyclic digraphs.