TY - JOUR

T1 - Eigenvalues of Adjacency and Laplacian Matrices of Bracelet-KnGraph

AU - Albirri, E. R.

AU - Fatahillah, A.

AU - Hussen, S.

AU - Sugeng, K. A.

N1 - Publisher Copyright:
© 2021 Published under licence by IOP Publishing Ltd.

PY - 2021/3/18

Y1 - 2021/3/18

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85103333093&partnerID=8YFLogxK

U2 - 10.1088/1742-6596/1839/1/012038

DO - 10.1088/1742-6596/1839/1/012038

M3 - Conference article

AN - SCOPUS:85103333093

VL - 1839

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

SN - 1742-6588

IS - 1

M1 - 012038

T2 - 2nd International Conference on Lesson Study of Science Technology Engineering and Mathematics 2020, ICOLSSTEM 2020

Y2 - 19 September 2020 through 20 September 2020

ER -