TY - JOUR AU - Wahri Irawan AU - Kiki Sugeng PY - 2022/03/21 Y2 - 2024/03/29 TI - CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN JF - BAREKENG: Jurnal Ilmu Matematika dan Terapan JA - BAREKENG: J. Math. & App. VL - 16 IS - 1 SE - Articles DO - 10.30598/barekengvol16iss1pp041-046 UR - https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/4038 AB - Let  be a simple, connected, and undirected graph. The graph  can be represented as a matrix such as antiadjacency matrix. An antiadjacency matrix for an undirected graph with order  is a matrix that has an order  and symmetric so that the antiadjacency matrix has a determinant and characteristic polynomial. In this paper, we discuss the properties of antiadjacency matrix of a graph join, such as its determinant and characteristic polynomial. A graph join  is obtained of a graph join operation obtained from joining two disjoint graphs  and . ER -