Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Pythagoras: Jurnal Matematika dan Pendidikan Matematika
Oktriyansa, Resa
Unknown Affiliation
Education Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Spektrum Laplace Graf Mahkota dan Graf Benteng Triyani, Triyani; Oktriyansa, Resa; Nurshiami, Siti Rahma
PYTHAGORAS Jurnal Matematika dan Pendidikan Matematika Vol. 19 No. 1: June 2024
Publisher : Department of Mathematics Education, Faculty of Mathematics and Natural Sciences, UNY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21831/pythagoras.v19i1.60818

Abstract

Spektrum dari suatu graf adalah susunan nilai eigen dari matriks ketetanggaan graf beserta multiplisitasnya. Spektrum graf yang dihasilkan dari matriks Laplace disebut spektrum Laplace. Matriks Laplace dari graf diperoleh dari selisih matriks ketetangaan graf dengan matriks diagonal dimana elemen-elemen diagonal utamanya merupakan derajat simpul dari graf. Penelitian ini mengkaji bentuk spektrum Laplace dari graf Mahkota dan graf Benteng. Graf Mahkota adalah graf yang diperoleh dari komplemen hasil perkalian kartesian graf Lengkap K2 dan graf Lengkap Kn. Sementara itu graf Benteng Bnn adalah graf yang diperoleh dari hasil perkalian kartesian dua buah graf Lengkap Kn. Hasil penelitian telah diperoleh polinomial karakteristik dari matriks Laplace untuk graf Mahkota dengan n>=3 dan graf Benteng Bnn dengan n>=2. Lebih lanjut spektrum Laplace dari kedua graf juga telah diperoleh. The spectrum on a graph is a set of eigenvalues of the adjacency matrix along with their multiplicities. The spectrum of a Laplace matrix is called the Laplace spectrum. The Laplace matrix of a graph is obtained from the difference between a adjacency matrix and a diagonal matrix where the elemens of main diagonal are the vertices degree of the graph. This research studied the Laplace spectrum on the crown graph and the rook graph.  A crown graph is a graph obtained from the complement of the cartesian product of complete graph K2 and Kn. Meanwhile, rook graph is a graph obtained from the cartesian product of two complete graph Kn. The results of study are formula of the characteristic polynomial of Laplace matrix for the crown graph with n>=3 and the rook graph with n>=2. Furthermore, the Laplace spectrum of both graphs has also been obtained.
Co-Authors Nurshiami, Siti Rahma Triyani Triyani