CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN

Wahri Irawan, Kiki Ariyanti Sugeng

Research output: Contribution to journalArticlepeer-review

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 .
Original languageEnglish
Pages (from-to)041-046
JournalBAREKENG: Jurnal Ilmu Matematika dan Terapan
Volume16
Issue number1
DOIs
Publication statusPublished - 21 Mar 2022

Keywords

  • antiadjacency matrix
  • graph join
  • characteristic polynomial of antiadjacency matrix

Fingerprint

Dive into the research topics of 'CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN'. Together they form a unique fingerprint.

Cite this