Melola Discovery

← Melola Discovery

Jurnal SINTA 3

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

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 16 No. 2 (2022) · hlm. 497–506

DOI
10.30598/barekengvol16iss2pp497-506
ISSN
2615-3017, 1978-7227
Terbit
2022-06-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng

Abstrak

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
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Wahri IrawanSyarif Hidayatullah State Islamic University Jakarta1
Fadila ParadiseUniversity of Indonesia1
Fawwaz Chirag; Combinatorics and Algebra Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, Indonesia SofyanAfiliasi tidak diketahui1
Syafrizal; Department of Mathematics and Data Science, Faculty of Mathematics and Natural Sciences, Andalas University, Padang, Indonesia SyAfiliasi tidak diketahui1
Nurdin; Graph Theory Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Hasanuddin University, Indonesia HindingAfiliasi tidak diketahui1
Rinovia; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia SimanjuntakAfiliasi tidak diketahui1

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.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH  DIRECTED DIGON(S)</dc:title>
	<dc:creator>Prayitno, Muhammad Irfan Arsyad</dc:creator>
	<dc:creator>Sugeng, Kiki Ariyanti</dc:creator>
	<dc:description xml:lang="en-US">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. </dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2022-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/5128</dc:identifier>
	<dc:identifier>10.30598/barekengvol16iss2pp497-506</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 16 No 2 (2022): BAREKENG: Jurnal Ilmu Matematika dan Terapan; 497-506</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol16iss2year2022</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/5128/4478</dc:relation>
</oai_dc:dc>