Spectrum of anti-gallai graph of some graphs

The anti-Gallai graph Delta(G) of a graph G, has the edges of G as its vertices and two distinct edges are adjacent in Delta(G) if they lie on a triangle in G. In this paper we characterize the graphs whose anti-Gallai graph has only one or two eigenvalues and study the adjacency spectrum of the anti-Gallai graph of (K-4,H)-free graphs, where H is the Hajos graph and graphs in which two diamonds share at most one vertex. We also find expressions for the adjacency spectrum of anti-Gallai graph of graphs after applying certain binary operations.