Construction of matrices with a given graph and prescribed interlaced spectral data

DOI10.1016/j.laa.2013.01.036zbMath1282.05141OpenAlexW2098545983MaRDI QIDQ389714

Keivan Hassani Monfared, Bryan L. Shader

Publication date: 21 January 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2013.01.036

zbMATH Keywords

graphinverse eigenvalue problemsymmetric matrixCauchy interlacing inequalitiesDuarte property

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items

Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph ⋮ Inverse eigenvalue problems for two special acyclic matrices ⋮ Inverse singular value problem for nonsymmetric ahead arrow matrix ⋮ Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph ⋮ The nowhere-zero eigenbasis problem for a graph ⋮ The λ − τ structured inverse eigenvalue problem ⋮ Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede ⋮ Orthogonal symmetric matrices and joins of graphs ⋮ A structured inverse spectrum problem for infinite graphs ⋮ Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs ⋮ The liberation set in the inverse eigenvalue problem of a graph ⋮ Unnamed Item ⋮ Sparks of symmetric matrices and their graphs ⋮ Generalized inverse eigenvalue problem for matrices whose graph is a path ⋮ On the inverse eigenvalue problem for block graphs ⋮ Construction of real skew-symmetric matrices from interlaced spectral data, and graph ⋮ The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2 ⋮ Spectral characterization of matchings in graphs ⋮ Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs. ⋮ Unnamed Item ⋮ On the inverse eigenvalue problem for a special kind of acyclic matrices.

Cites Work

• The nilpotent-centralizer method for spectrally arbitrary patterns
• Construction of acyclic matrices from spectral data
• Inverse eigenvalue problems for Jacobi matrices
• The behavior of eigenvalues and singular values under perturbations of restricted rank
• Construction of a Jacobi matrix from spectral data
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Principal submatrices of normal and Hermitian matrices
• Imbedding Conditions for Hermitian and Normal Matrices
• Matrices with Prescribed Characteristic Roots and Diagonal Elements
• Unnamed Item
• Unnamed Item
• Unnamed Item