Wahri Irawan
Department of Islamic Insurance, Faculty of Islamic Economic and Business, Universitas Islam Negeri Sultan Maulana Hasanuddin Banten

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN Wahri Irawan; Kiki Ariyanti Sugeng
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 16 No 1 (2022): BAREKENG: Jurnal Ilmu Matematika dan Terapan
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (947.33 KB) | DOI: 10.30598/barekengvol16iss1pp041-046

Abstract

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 .