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.
Jaringan kolaborasi para penulis
8 penulis ·
13 tautan kepenulisan bersama
· 1 lintas organisasi
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
University of Indonesia
Syarif Hidayatullah State Islamic University Jakarta
Afiliasi tidak diketahui
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.