Title of article
Note on skew-eigenvalues of digraphs
Author/Authors
Taghvaee ، Fatemeh Department of Mathematics - Faculty of Mathematical Sciences - University of Kashan , Fath-Tabar ، Gholam Hossein Department of Mathematics - Faculty of Mathematical Sciences - University of Kashan
From page
225
To page
234
Abstract
. Let Gσ be an oriented graph with underlying simple graph G. The skew-adjacency matrix of Gσ is the {0, 1, −1}-matrix S = S(Gσ) = [sij ], such that sij = 1 if (vi, vj ) is an arc in Gσ , sij = −1 if (vj , vi) is an arc in Gσ and sij = 0, otherwise. In this paper, all connected oriented graphs with three distinct skew-eigenvalues 0 and ±2i are characterized.
Keywords
skew adjacency matrix , oriented graph , Skew , eigenvalue
Journal title
Transactions on Combinatorics
Journal title
Transactions on Combinatorics
Record number
2772545
Link To Document