Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
DOI10.1016/j.laa.2023.09.013zbMath1526.05085arXiv2303.07949MaRDI QIDQ6084878
Mark Kempton, Shaun M. Fallat, Aida Abiad, Rupert H. Levene, Polona Oblak, Kevin N. Vander Meulen, Michael Tait, Helena Šmigoc
Publication date: 6 November 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.07949
pathscycleshypercubesinverse eigenvalue problemminimum number of distinct eigenvaluesjoins of graphsborderings
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- The nowhere-zero eigenbasis problem for a graph
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
- Construction of matrices with a given graph and prescribed interlaced spectral data
- On the minimum rank of the join of graphs and decomposable graphs
- Construction of acyclic matrices 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.
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
- Orthogonal symmetric matrices and joins of graphs
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
- Matrix Analysis
- A survey of matrix inverse eigenvalue problems
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
- Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
- Inverse Problems and Zero Forcing for Graphs
- Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
- Minimum number of distinct eigenvalues of graphs
This page was built for publication: Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
