Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments (Q2302884)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments |
scientific article |
Statements
Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments (English)
0 references
26 February 2020
0 references
assignments
0 references
branch duplication
0 references
combinatorially symmetric
0 references
diagonalizable matrix
0 references
diameter
0 references
eigenvalue
0 references
geometric multiplicity
0 references
graph of a matrix
0 references
tree
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
