Antiadjacency and Hermitian Antiadjacency Matrices of Mixed Graphs

Main Article Content

Muhammad Irfan Arsyad Prayitno
Yeni Susanti
Sri Wahyuni

Abstract

The complement of a graph records the adjacencies absent from the original graph, and its adjacency matrix coincides with the antiadjacency matrix of the original graph. In this paper, this relation is extended to mixed graphs by introducing the Hermitian antiadjacency matrix and proving that it coincides with the Hermitian adjacency matrix of the complement mixed graph. Formulas for its powers, determinant, and characteristic polynomial are obtained, together with spectral relations between a mixed graph and its complement. The antiadjacency and Hermitian antiadjacency matrices are also compared, clarifying their corresponding algebraic and spectral properties.

Article Details

Section

Articles

How to Cite

Antiadjacency and Hermitian Antiadjacency Matrices of Mixed Graphs. (2026). Gulf Journal of Mathematics, 24(2). https://doi.org/10.56947/a1830862