Abstract
AbstractA theorem on the number of distinct eigenvalues of diagonalizable matrices is obtained. Some applications related to the problem of separation of close eigenvalues, triangular defective matrices as well as adjacency and walk matrices of graphs are discussed. Other ideas and examples are provided.
Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. Ahmadi, B.; et al.: Minimum number of distinct eigenvalues of graphs. Electro. J. linear Algebra 26, 673–691 (2013)
2. Andelic, M.; et al.: Some new considerations about double nested graphs. Linear Algebra Appl. 483, 323–341 (2015)
3. Barrett, W.; et al.: Generalization of the strong Arnold property and the minimum number of distinct eigenvalues of a graph. Electron. J. Combin. 24, 2–40 (2017)
4. Brualdi, R.; Ryser, H.J.: Combinatorial Matrix Theory. Cambridge University Press, Cambridge (1991)
5. Bu, C.; Zhang, X.; Zhou, J.: A note on the multiplicities of graph eigenvalues. Linear Algebra Appl. 422, 69–74 (2014)