Melola Discovery

← Melola Discovery

Akses terbuka Jurnal

Spectral Characteristics of The Antiadjacency Matrix of Kite Graph

Jurnal Matematika, Statistika dan Komputasi · Vol. 21 No. 2 (2025) · hlm. 345–353

DOI
10.20956/j.v21i2.40490
ISSN
2614-8811, 1858-1382
Terbit
2025-01-12
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

Let G=(V,E) be a connected graph, where V is the set of vertices and E is the set of edges of G. The kite graph, denoted by Kiten,m, is a graph obtained by appending a complete graph Kn to a pendant vertex of path Pm. This research investigates the spectrum of antiadjacency matrix of kite graph. The antiadjacency matrix of a graph G of order n is a square matrix with order n where the entries of the matrix represent the nonadjacency of the vertices.

Kata kunci

Jaringan kolaborasi para penulis

5 penulis · 6 tautan kepenulisan bersama · 2 lintas organisasi

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

  • University of Indonesia
  • Bandung Institute of Technology
  • 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
Edy Tri BaskoroBandung Institute of Technology1
Saladin UttunggadewaBandung Institute of Technology1

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://journal.unhas.ac.id/index.php/jmsk/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">Spectral Characteristics of The Antiadjacency Matrix of Kite Graph</dc:title>
	<dc:creator xml:lang="en">Camilla, Miming Fikria</dc:creator>
	<dc:creator xml:lang="en">Rensiana, Melza</dc:creator>
	<dc:creator xml:lang="en">Silaban, Denny Riama</dc:creator>
	<dc:subject xml:lang="en">Anti-adjacency matrix</dc:subject>
	<dc:subject xml:lang="en">spectrum</dc:subject>
	<dc:subject xml:lang="en">characteristic polynomial</dc:subject>
	<dc:subject xml:lang="en">complete graph</dc:subject>
	<dc:subject xml:lang="en">path</dc:subject>
	<dc:description xml:lang="en">Let G=(V,E)  be a connected graph, where V is the set of vertices and E is the set of edges of G. The kite graph, denoted by Kiten,m, is a graph obtained by appending a complete graph Kn to a pendant vertex of path Pm. This research investigates the spectrum of antiadjacency matrix of kite graph. The antiadjacency matrix of a graph G of order n is a square matrix with order n where the entries of the matrix represent the nonadjacency of the vertices.
 </dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2025-01-12</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://journal.unhas.ac.id/index.php/jmsk/article/view/40490</dc:identifier>
	<dc:identifier>10.20956/j.v21i2.40490</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 21 No. 2 (2025): JANUARY 2025; 345-353</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/40490/12432</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2025 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>