Diagonalizable Matrices Whose Graph Is a Tree: the Minimum Number of Distinct Eigenvalues and the Feasibility of Eigenvalue Assignments
AuthID
P-00R-M3T
P-00R-M3T
© 2024 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service