CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN

  • Wahri Irawan Department of Islamic Insurance, Faculty of Islamic Economic and Business, Universitas Islam Negeri Sultan Maulana Hasanuddin Banten
  • Kiki Ariyanti Sugeng Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia
DOI: https://doi.org/10.30598/barekengvol16iss1pp041-046
Keywords: antiadjacency matrix, graph join, characteristic polynomial of antiadjacency matrix

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 .

Downloads

Download data is not yet available.
Published
2022-03-21
How to Cite
[1]
W. Irawan and K. Sugeng, “CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN”, BAREKENG: J. Math. & App., vol. 16, no. 1, pp. 041-046, Mar. 2022.
Issue
Vol 16 No 1 (2022): BAREKENG: Jurnal Ilmu Matematika dan Terapan
Section
Articles

Authors who publish with this Journal agree to the following terms:

  1. Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
  2. Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
  3. Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.