EMIS ELibM Electronic Journals Publications de l'Institut Mathématique, Nouvelle Série
Vol. 85(99), pp. 47–54 (2009)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

Pick a mirror

 		 

ON RELATION BETWEEN SPECTRA OF GRAPHS AND THEIR DIGRAPH DECOMPOSITIONS

Dragan Stevanovic and Sanja Stevanovic

University of Nis—PMF, Nis, Serbia and Faculty of Civil Engineering and Architecture, University of Nis, Nis, Serbia

Abstract: 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.

Keywords: Adjacency matrix; Digraph; Decomposition; Eigenvalues

Classification (MSC2000): 05C50

Full text of the article: (for faster download, first choose a mirror)

Electronic fulltext finalized on: 23 Apr 2009. This page was last modified: 22 Oct 2009.

© 2009 Mathematical Institute of the Serbian Academy of Science and Arts
© 2009 ELibM and FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition