Eigenvalues of oriented-graph matrices (Q1893108): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Jiong-Sheng Li / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Noburo Ito / rank | |||
| Property / author | |||
| Property / author: Jiong-Sheng Li / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Noburo Ito / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3943082 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the characteristic roots of tournament matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic multiplicity of the eigenvalues of a tournament matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pick's inequality and tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On multipartite tournament matrices with constant team size<sup>∗</sup> / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5331504 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Generalized Tournament Matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3342600 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:08, 23 May 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
