Sparks of symmetric matrices and their graphs

DOI10.13001/ELA.2023.8025MaRDI QIDQ6202068zbMATH OpenOpenAlexFDO

Authors L. Deaett, Shaun M. Fallat, Veronika Furst, John Hutchens, Lon H. Mitchell, Yaqi 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

zbMATH Keywords

connectivitysparkmaximum nullityminimum rankzero forcingnull vectorsfortsgeneric nullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29)

Recommendations

• Null space structure of tree-patterned matrices
• The minimum rank of symmetric matrices described by a graph: a survey
• Remarks on the spark of a matrix and the null space property
• Zero forcing sets and the minimum rank of graphs
• Uniformly sparse graphs and matrices

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A correction: Orthogonal representations and connectivity of graphs
• Compressed sensing
• Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
• Computational approaches for zero forcing and related problems
• Construction of matrices with a given graph and prescribed interlaced spectral data
• Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
• Eigenvalues, multiplicities and graphs
• Eigenvectors of acyclic matrices
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Graphs whose minimal rank is two
• Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
• Inverse Problems and Zero Forcing for Graphs
• Maximum generic nullity of a graph
• Minimum-rank matrices with prescribed graph
• Null space structure of tree-patterned matrices
• Olga, matrix theory and the Taussky unification problem
• On Fiedler- and Parter-vertices of acyclic matrices
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• On the complexity of failed zero forcing
• On the null space structure associated with trees and cycles
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Orthogonal representations and connectivity of graphs
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Positive semidefinite maximum nullity and zero forcing number
• Spectral multiplicity and splitting results for a class of qualitative matrices
• The combinatorial inverse eigenvalue problem. II: All cases for small graphs
• The failed zero forcing number of a graph
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
• The minimum rank of symmetric matrices described by a graph: a survey
• When Does Rank(A+B)=Rank(A)+Rank(B)?
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: Sparks of symmetric matrices and their graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202068)