Antiadjacency and Hermitian Antiadjacency Matrices of Mixed Graphs
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.
Authors
- Yeni Susanti (ORCID: https://orcid.org/0000-0003-0739-7672)
- Muhammad Irfan Arsyad Prayitno
- Sri Wahyuni (ORCID: https://orcid.org/0000-0002-0421-2591)
Institutions
- Universitas Gadjah Mada (ID)
Publication Details
- Journal
- Gulf Journal of Mathematics
- Published
- 2026-11-20
- DOI
- https://doi.org/10.56947/a1830862
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00