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

Research output: Contribution to journalArticle

1 Citation (Scopus)
3 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