On the N-spectrum of oriented graphs

On the N-spectrum of oriented graphs

Given any digraph , its non-negative spectrum (or N-spectrum, shortly) consists of the eigenvalues of the matrix , where is the adjacency matrix of . In this study, we relate the classical spectrum of undirected graphs to the N-spectrum of their oriented counterparts, permitting us to derive spectra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Open mathematics (Warsaw, Poland) Poland), 2020-06, Vol.18 (1), p.486-495
Hauptverfasser: Abudayah, Mohammad, Alomari, Omar, Sander, Torsten
Format: Artikel
Sprache:eng
Schlagworte:
05C50
15A18
digraph
Eigenvalues
Graph theory
Graphs
non-negative spectrum
singular values
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Given any digraph , its non-negative spectrum (or N-spectrum, shortly) consists of the eigenvalues of the matrix , where is the adjacency matrix of . In this study, we relate the classical spectrum of undirected graphs to the N-spectrum of their oriented counterparts, permitting us to derive spectral bounds. Moreover, we study the spectral effects caused by certain modifications of a given digraph.
ISSN:2391-5455
2391-5455
DOI:10.1515/math-2020-0167