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

DOI10.1016/j.laa.2015.01.001zbMath1308.65057arXiv1412.6085OpenAlexW2039285667MaRDI QIDQ2261540

Keivan Hassani Monfared, Sudipta Mallik

Publication date: 6 March 2015

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

Full work available at URL: https://arxiv.org/abs/1412.6085

zbMATH Keywords

treegraphskew-symmetric matrixJacobian methodstructured inverse eigenvalue problemCauchy interlacing inequalitiesDuarte property

Mathematics Subject Classification ID

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

Related Items (2)

Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph ⋮ Spectral characterization of matchings in graphs

Cites Work

• Unnamed Item
• Construction of matrices with a given graph and prescribed interlaced spectral data
• Skew-adjacency matrices of graphs
• Minimum rank of skew-symmetric matrices described by a graph
• Construction of acyclic matrices from spectral data
• Structured inverse eigenvalue problems
• A survey of matrix inverse eigenvalue problems
• Inverse Eigenvalue Problems
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: Construction of real skew-symmetric matrices from interlaced spectral data, and graph