Abstract
The spark of a matrix is the smallest number of nonzero coordinates of any nonzero null vector. For real symmetric matrices, the sparsity of null vectors is shown to be associated with the structure of the graph obtained from the off-diagonal pattern of zero and nonzero entries. The smallest possible spark of a matrix corresponding to a graph is defined as the spark of the graph. Connections are established between graph spark and well-known concepts including minimum rank, forts, orthogonal representations, Parter and Fiedler vertices, and vertex connectivity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
