The non-negative spectrum of a digraph
Given the adjacency matrix A of a digraph, the eigenvalues of the matrix AAT constitute the so-called non-negative spectrum of this digraph. We investigate the relation between the structure of digraphs and their non-negative spectra and associated eigenvectors. In particular, it turns out that the...
Main Authors: | Alomari Omar, Abudayah Mohammad, Sander Torsten |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2020-02-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | http://www.degruyter.com/view/j/math.2020.18.issue-1/math-2020-0005/math-2020-0005.xml?format=INT |
Similar Items
-
On the N-spectrum of oriented graphs
by: Abudayah Mohammad, et al.
Published: (2020-06-01) -
Spectrum of free-form Sudoku graphs
by: Abudayah Mohammad, et al.
Published: (2018-12-01) -
Oriented Incidence Colourings of Digraphs
by: Duffy Christopher, et al.
Published: (2019-02-01) -
The spectrum problem for digraphs of order 4 and size 5
by: Ryan C. Bunge, et al.
Published: (2018-01-01) -
Products Of Digraphs And Their Competition Graphs
by: Sonntag Martin, et al.
Published: (2016-02-01)