On the inverse eigenvalue problem for block graphs
From MaRDI portal
Publication:2238880
DOI10.1016/j.laa.2021.09.008zbMath1476.05120arXiv2012.12495OpenAlexW3201318393MaRDI QIDQ2238880
Polona Oblak, Jephian C.-H. Lin, Helena Šmigoc
Publication date: 2 November 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.12495
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical solutions to inverse eigenvalue problems (65F18)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of matrices with a given graph and prescribed interlaced spectral data
- The implicit function theorem. History, theory, and applications
- The inverse eigenvalue problem for nonnegative matrices
- Inverse problems in vibrations.
- Eigenvalues of nonnegative symmetric matrices
- Inverse eigenvalue problems for Jacobi matrices
- Construction of a Jacobi matrix from spectral data
- Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- On the construction of a Jacobi matrix from spectral data
- The inverse eigenvalue problem of a graph: multiplicities and minors
- The strong spectral property for graphs
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Graphs that allow all the eigenvalue multiplicities to be even
- Zero forcing sets and the minimum rank of graphs
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
- Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
- Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
- Minimum number of distinct eigenvalues of graphs