Diagonalizable matrices whose graph is a tree: The minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments

Carlos M. Saiago

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)
44 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Diagonalizable matrices whose graph is a tree: The minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments'. Together they form a unique fingerprint.

Mathematics