The repository administrator has not yet configured an RDF license.
NILAI EIGEN PADA MATRIKS ANTIADJACENCY DARI GRAF IDENTITAS GRUP SIKLIK ATAS BILANGAN BULAT BERORDO GENAP
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.
FAKULTAS SAINS DAN TEKNOLOGI, UIN SUNAN KALIJAGA YOGYAKARTA
NILAI EIGEN PADA MATRIKS ANTIADJACENCY DARI GRAF IDENTITAS GRUP SIKLIK ATAS BILANGAN BULAT BERORDO GENAP (Text)
HTML Summary of #76656 NILAI EIGEN PADA MATRIKS ANTIADJACENCY DARI GRAF IDENTITAS GRUP SIKLIK ATAS BILANGAN BULAT BERORDO GENAP