On the N-spectrum of oriented graphs
Given any digraph D, its non-negative spectrum (or N-spectrum, shortly) consists of the eigenvalues of the matrix AA T, where A is the adjacency matrix of D. In this study, we relate the classical spectrum of undirected graphs to the N-spectrum of their oriented counterparts, permitti...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2020-06-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2020-0167 |