Inverse eigenvalue and related problems for hollow matrices described by graphs
F.S. Dahlgren (Georgia State University, TU Delft - Network Architectures and Services)
Zachary Gershkoff (Louisiana State University)
Leslie Hogben (Iowa State University, American Institute of Mathematics)
Sara Motlaghian (Georgia State University)
Derek Young (Mount Holyoke College)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
A hollow matrix described by a graph G is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in G. For a given graph G, the determination of all possible spectra of matrices associated with G is the hollow inverse eigenvalue problem for G. Solutions to the hollow inverse eigenvalue problems for paths and complete bipartite graphs are presented. Results for related subproblems such as possible ordered multiplicity lists, maximum multiplicity of an eigenvalue, and minimum number of distinct eigenvalues are presented for additional families of graphs.