ON RELATION BETWEEN SPECTRA OF GRAPHS AND THEIR DIGRAPH DECOMPOSITIONS


Dragan Stevanović, Sanja Stevanović


A graph, consisting of undirected edges, can be represented as a sum of two digraphs, consisting of oppositely oriented directed edges. Gutman and Plath in [J. Serb. Chem. Soc. 66 (2001), 237--241] showed that for annulenes, the eigenvalue spectrum of the graph is equal to the sum of the eigenvalue spectra of respective two digraphs. Here we exhibit a number of other graphs with this property.