Sparks of symmetric matrices and their graphs
From MaRDI portal
Publication:6202068
DOI10.13001/ela.2023.8025OpenAlexW4388857145MaRDI QIDQ6202068
Shaun M. Fallat, Louis Deaett, Veronika Furst, Lon H. Mitchell, John Hutchens, Ya-qi Zhang
Publication date: 21 February 2024
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.13001/ela.2023.8025
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of matrices with a given graph and prescribed interlaced spectral data
- On the complexity of failed zero forcing
- Spectral multiplicity and splitting results for a class of qualitative matrices
- Maximum generic nullity of a graph
- On Fiedler- and Parter-vertices of acyclic matrices
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
- Zero forcing parameters and minimum rank problems
- The minimum rank of symmetric matrices described by a graph: a survey
- Olga, matrix theory and the Taussky unification problem
- Null space structure of tree-patterned matrices
- A correction: Orthogonal representations and connectivity of graphs
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- Computational approaches for zero forcing and related problems
- Orthogonal representations and connectivity of graphs
- The inverse eigenvalue problem of a graph: multiplicities and minors
- On the zero blocking number of rectangular, cylindrical, and Möbius grids
- The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
- The failed zero forcing number of a graph
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Zero forcing sets and the minimum rank of graphs
- Minimum-rank matrices with prescribed graph
- Positive semidefinite maximum nullity and zero forcing number
- Eigenvectors of acyclic matrices
- On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
- Eigenvalues, Multiplicities and Graphs
- Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
- Graphs whose minimal rank is two
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
- Inverse Problems and Zero Forcing for Graphs
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- When Does Rank(A+B)=Rank(A)+Rank(B)?
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- Compressed sensing
