On relation between spectra of graphs and their digraph decompositions | Zendy

Dragan Stevanović | Zendy; Sanja Stevanović | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On relation between spectra of graphs and their digraph decompositions

Author(s) -

Dragan Stevanović,

Sanja Stevanović

Publication year - 2009

Publication title -

publications de l institut mathematique

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.246

H-Index - 17

eISSN - 1820-7405

pISSN - 0350-1302

DOI - 10.2298/pim0999047s

Subject(s) - digraph , combinatorics , eigenvalues and eigenvectors , mathematics , spectrum (functional analysis) , graph , spectral line , discrete mathematics , physics , quantum mechanics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research