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

DOI10.1016/J.LAA.2013.01.036MaRDI QIDQ389714zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Construction of real skew-symmetric matrices from interlaced spectral data, and graph
• Construction of acyclic matrices from spectral data
• Realizations of interlacing by tree-patterned matrics
• scientific article; zbMATH DE number 2203299
• Implicit construction of multiple eigenvalues for trees

Cites work

• scientific article; zbMATH DE number 3144516 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1765103 (Why is no real title available?)
• Construction of a Jacobi matrix from spectral data
• Construction of acyclic matrices from spectral data
• Imbedding Conditions for Hermitian and Normal Matrices
• Inverse eigenvalue problems for Jacobi matrices
• Matrices with Prescribed Characteristic Roots and Diagonal Elements
• Principal submatrices of normal and Hermitian matrices
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• The behavior of eigenvalues and singular values under perturbations of restricted rank
• The nilpotent-centralizer method for spectrally arbitrary patterns

Cited in

(27)

• Constructions of graphs and trees with partially prescribed spectrum
• On the inverse eigenvalue problem for block graphs
• Inverse eigenvalue problems for two special acyclic matrices
• The nowhere-zero eigenbasis problem for a graph
• Construction of acyclic matrices from spectral data
• The λ − τ structured inverse eigenvalue problem
• The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2
• Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs.
• On the inverse eigenvalue problem for a special kind of acyclic matrices.
• Input matrix construction and approximation using a graphic approach
• The liberation set in the inverse eigenvalue problem of a graph
• Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph
• Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede
• Construction of real skew-symmetric matrices from interlaced spectral data, and graph
• The inverse nullity pair problem and the strong nullity interlacing property
• An inverse eigenvalue problem for structured matrices determined by graph pairs
• Inverse eigenvalue problems with partial eigen data for acyclic matrices whose graph is a broom
• Construction of symmetric pentadiagonal matrix from three interlacing spectrum
• Inverse singular value problem for nonsymmetric ahead arrow matrix
• Generalized inverse eigenvalue problem for matrices whose graph is a path
• Sparks of symmetric matrices and their graphs
• Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
• Realizations of interlacing by tree-patterned matrics
• A structured inverse spectrum problem for infinite graphs
• Orthogonal symmetric matrices and joins of graphs
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Spectral characterization of matchings in graphs

This page was built for publication: Construction of matrices with a given graph and prescribed interlaced spectral data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389714)