Eigenvalues of oriented-graph matrices (Q1893108): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eigenvalues of oriented-graph matrices |
scientific article |
Statements
Eigenvalues of oriented-graph matrices (English)
0 references
27 November 1995
0 references
The author proves a few theorems concerning eigenvalues of adjacency matrices of digraphs. For instance, if the adjacency matrix \(M\) of a digraph of order at least three is irreducible, then \(M\) has at least three distinct eigenvalues, and \(M\) has precisely three eigenvalues if and only if the digraph is an Hadamard tournament. This generalizes a result of \textit{N. Zagaglia Salvi} [Rend. Semin. Mat. Brescia 7, 635-643 (1984; Zbl 0549.05030)].
0 references
oriented-graph matrices
0 references
eigenvalues
0 references
adjacency matrices
0 references
digraphs
0 references
Hadamard tournament
0 references
