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

DOI10.1016/J.LAA.2013.01.036zbMATH Open1282.05141OpenAlexW2098545983MaRDI QIDQ389714FDOQ389714

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The behavior of eigenvalues and singular values under perturbations of restricted rank
• Construction of acyclic matrices from spectral data
• Imbedding Conditions for Hermitian and Normal Matrices
• Title not available (Why is that?)
• Construction of a Jacobi matrix from spectral data
• Inverse eigenvalue problems for Jacobi matrices
• 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
• Matrices with Prescribed Characteristic Roots and Diagonal Elements
• 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
• Input matrix construction and approximation using a graphic approach
• The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2
• The liberation set in the inverse eigenvalue problem of a graph
• 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.
• 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
• The inverse nullity pair problem and the strong nullity interlacing property
• Construction of real skew-symmetric matrices from interlaced spectral data, and graph
• 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
• 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
• Generalized inverse eigenvalue problem for matrices whose graph is a path
• 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)