Existence of a Not Necessarily Symmetric Matrix with Given Distinct Eigenvalues and Graph

Abstract

For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph is G. In particular, this implies that any real matrix with distinct eigenvalues is similar to a real, irreducible, tridiagonal matrix.

References in corpus (1)

• Construction of real skew-symmetric matrices from interlaced spectral data and graph