NILAI EIGEN PADA MATRIKS ANTIADJACENCY DARI GRAF IDENTITAS GRUP SIKLIK ATAS BILANGAN BULAT BERORDO GENAP

Atina Putri Sholihah, NIM.: 22106010032 (2026) NILAI EIGEN PADA MATRIKS ANTIADJACENCY DARI GRAF IDENTITAS GRUP SIKLIK ATAS BILANGAN BULAT BERORDO GENAP. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

	Text (NILAI EIGEN PADA MATRIKS ANTIADJACENCY DARI GRAF IDENTITAS GRUP SIKLIK ATAS BILANGAN BULAT BERORDO GENAP) 22106010032_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (2MB)
	Text (NILAI EIGEN PADA MATRIKS ANTIADJACENCY DARI GRAF IDENTITAS GRUP SIKLIK ATAS BILANGAN BULAT BERORDO GENAP) 22106010032_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf Restricted to Registered users only Download (2MB) | Request a copy

Abstract

An identity graph is a graph constructed by connecting each element with its invers, so that the resulting graph structure has a symmetric adjacency pattern that can be represented by an adjacency matrix. The antiadjacency matrix is the obtained as the complement to the adjacency matrix. In this study, the general formation of both matrices is studied and the characteristic polynomial of the antiadjacency matrix is derived. The analysis continues by determining the eigenvalues as solutions of obtained characteristic polynomial. The main result is a general formula for the characteristic polynomial and its associated eigenvalues for the identity graph Zn with even n.

Share this knowledge with your friends :

Actions (login required)

View Item