Eigenvalues of Adjacency and Laplacian Matrices of Bracelet-KnGraph

E. R. Albirri, A. Fatahillah, S. Hussen, K. A. Sugeng

Research output: Contribution to journalConference articlepeer-review


Let G be an undirected simple graph. Adjacency matrix of a graph G, denoted by (A(G)), is defined as a matrix which has entry-(i, j) is equal 1 if vertex i and vertex j are adjacent and 0 if otherwise. Let D(G) be the diagonal matrix of vertex degree and J(G) be the matrix which has entry all ones. Laplacian matrix (L(G)) can be defined by L(G) = D(G)-A(G). This study discusses eigenvalues of adjacency and Laplacian matrices of the Bracelet-Kn graph. The results of this study indicate that the Bracelet-Kn graph for n ≥ 4, n even has four different eigenvalues of adjacency and Laplacian matrices.

Original languageEnglish
Article number012038
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 18 Mar 2021
Event2nd International Conference on Lesson Study of Science Technology Engineering and Mathematics 2020, ICOLSSTEM 2020 - Jember, East Java, Indonesia
Duration: 19 Sept 202020 Sept 2020


Dive into the research topics of 'Eigenvalues of Adjacency and Laplacian Matrices of Bracelet-KnGraph'. Together they form a unique fingerprint.

Cite this