ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)

Prayitno, Muhammad Irfan Arsyad
Sugeng, Kiki Ariyanti

BAREKENG: Jurnal Ilmu Matematika dan Terapan
Vol 16 No 2 (2022): BAREKENG: Jurnal Ilmu Matematika dan Terapan

The antiadjacency matrix is one representation matrix of a digraph. In this paper, we find the determinant and the characteristic polynomial of the antiadjacency matrix of a digraph with directed digon(s). The digraph that we will discuss is a digraph obtained by adding arc(s) in an arborescence path digraph such that it contained directed digon(s), and a digraph obtained by deleting arc(s) in a complete star digraph. We found that the determinant and the coefficient of the characteristic polynomial of the antiadjacency matrix of a digraph obtained by adding arc(s) in an arborescence path digraph such that it contained directed digon(s) is different depending on the location of the directed digon. Meanwhile, the determinant of the antiadjacency matrix of a digraph obtained by deleting arc(s) in the complete star digraph is zero.