Saiago, Carlos M.. "Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments"
Special Matrices, vol. 7, no. 1, 2019, pp. 316-326.
https://doi.org/10.1515/spma-2019-0025Saiago, C. (2019). Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments.
Special Matrices,
7(1), 316-326.
https://doi.org/10.1515/spma-2019-0025Saiago, C. (2019) Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments. Special Matrices, Vol. 7 (Issue 1), pp. 316-326.
https://doi.org/10.1515/spma-2019-0025Saiago, Carlos M.. "Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments"
Special Matrices 7, no. 1 (2019): 316-326.
https://doi.org/10.1515/spma-2019-0025Saiago C. Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments.
Special Matrices. 2019;7(1): 316-326.
https://doi.org/10.1515/spma-2019-0025
