The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2

DOI10.1016/j.laa.2021.03.021zbMath1462.05243OpenAlexW3138313417MaRDI QIDQ2020715

Debashish Sharma, Mausumi Sen

Publication date: 24 April 2021

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

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

zbMATH Keywords

inverse eigenvalue problemsleading principal submatricesgeneralized star of depth 2

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items

Two inverse eigenvalue problems for matrices whose graphs are trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Inverse eigenvalue problems for two special acyclic matrices
• Acyclic matrices with a small number of distinct eigenvalues
• Construction of matrices with a given graph and prescribed interlaced spectral data
• Generalized inverse eigenvalue problem with mixed eigendata
• Some inverse problems for acyclic matrices
• Inverse eigenvalue problems associated with spring-mass systems
• Inverse problems in vibrations.
• Construction of acyclic matrices from spectral data
• A matrix inverse eigenvalue problem and its application
• Generalized inverse eigenvalue problem for matrices whose graph is a path
• Extremal inverse eigenvalue problem for bordered diagonal matrices
• Two inverse eigenvalue problems for a special kind of matrices
• Two inverse eigenproblems for symmetric doubly arrow matrices
• On Some Eigenvector-Eigenvalue Relations
• Inverse Eigenvalue Problems
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Spectral graph theory and the inverse eigenvalue problem of a graph

This page was built for publication: The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2