The antiadjacency spectrum of some graph operations
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (4) · 1629-1650
DOI: 10.47974/jdmsc-2346 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von Mohammad Farhan und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Let Γ = (V, E) be a graph of order η with V = {1, 2, 3, …, η} and E ⊆ [V]2. The antiadjacency matrix of Γ is an η × η matrix where the ij-entry is 1 if ij ∉ E and 0 if otherwise. An antiadjacency matrix can be seen as the opposite of the adjacency matrix of graphs. In this paper, we give the spectrum of the antiadjacency matrix of some graph operations, namely, disjoint union of circulant graphs, Cartesian product of cycle graph and complete graph of order two, disjoint union of complete graphs, complement of a graph, and join of graphs.
Zitieren
APA
Farhan, M., John, P., & Silaban, D. R. (2026). The antiadjacency spectrum of some graph operations. Journal of Discrete Mathematical Sciences & Cryptography, 29(4), 1629-1650. https://doi.org/10.47974/jdmsc-2346
Vancouver
Farhan M, John P, Silaban DR. The antiadjacency spectrum of some graph operations. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(4):1629-1650. doi:10.47974/jdmsc-2346
BibTeX
@article{Farhan2026,
author = {Farhan, Mohammad and John, Peter and Silaban, Denny Riama},
title = {The antiadjacency spectrum of some graph operations},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {4},
pages = {1629--1650},
doi = {10.47974/jdmsc-2346}
}
EUVIMED