Mohammad Farhan

The antiadjacency spectrum of some graph operations

Mohammad Farhan, Peter John, Denny Riama Silaban

In this paper: 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 matr...