Melola Discovery

← Melola Discovery

Jurnal SINTA 3

CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 16 No. 1 (2022) · hlm. 041–046

DOI
10.30598/barekengvol16iss1pp041-046
ISSN
2615-3017, 1978-7227
Terbit
2022-03-21
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng

Abstrak

Let be a simple, connected, and undirected graph. The graph can be represented as a matrix such as antiadjacency matrix. An antiadjacency matrix for an undirected graph with order is a matrix that has an order and symmetric so that the antiadjacency matrix has a determinant and characteristic polynomial. In this paper, we discuss the properties of antiadjacency matrix of a graph join, such as its determinant and characteristic polynomial. A graph join is obtained of a graph join operation obtained from joining two disjoint graphs and.

Jaringan kolaborasi para penulis

10 penulis · 16 tautan kepenulisan bersama · 1 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Syarif Hidayatullah State Islamic University Jakarta
  • University of Indonesia
  • 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
Muhammad Irfan Arsyad PrayitnoUniversity of Indonesia1
Fadila ParadiseUniversity of Indonesia1
Muhammad ManaqibSyarif Hidayatullah State Islamic University Jakarta1
Nina FitriyatiSyarif Hidayatullah State Islamic University Jakarta1
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">CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN</dc:title>
	<dc:creator>Irawan, Wahri</dc:creator>
	<dc:creator>Sugeng, Kiki Ariyanti</dc:creator>
	<dc:description xml:lang="en-US">Let  &amp;nbsp;be a simple, connected, and undirected graph. The graph  &amp;nbsp;can be represented as a matrix such as antiadjacency matrix. An antiadjacency matrix for an undirected graph with order  &amp;nbsp;is a matrix that has an order  &amp;nbsp;and symmetric so that the antiadjacency matrix has a determinant and characteristic polynomial. In this paper, we discuss the properties of antiadjacency matrix of a graph join, such as its determinant and characteristic polynomial. A graph join &amp;nbsp;is obtained of a graph join operation obtained from joining two disjoint graphs  &amp;nbsp;and  .</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2022-03-21</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/4038</dc:identifier>
	<dc:identifier>10.30598/barekengvol16iss1pp041-046</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 16 No 1 (2022): BAREKENG: Jurnal Ilmu Matematika dan Terapan; 041-046</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol16iss1year2022</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/4038/4000</dc:relation>
</oai_dc:dc>