On the maximum positive semi-definite nullity and the cycle matroid of graphs

DOI10.13001/1081-3810.1304zbMATH Open1173.05031OpenAlexW2145459271MaRDI QIDQ3394468FDOQ3394468

Authors: Hein van der Holst 

Publication date: 7 September 2009

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130730

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Graphs whose positive semi-definite matrices have nullity at most two
• scientific article; zbMATH DE number 2202148
• A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
• Maximum nullity and zero forcing of circulant graphs
• Characterizing graphs with fully positive semidefinite \(Q\)-matrices
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• scientific article; zbMATH DE number 3845597
• Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
• scientific article; zbMATH DE number 2015222
• Maximum nullity of some Cayley graphs

zbMATH Keywords

graphsseparationmatroidsnullitypositive semi-definite matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (14)

• Frame graph
• Minimum rank of outerplanar graphs
• Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
• On the tree cover number of a graph
• The maximum corank of graphs with a 2-separation
• Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
• A new lower bound for the positive semidefinite minimum rank of a graph
• Zero forcing parameters and minimum rank problems
• Title not available (Why is that?)
• The inertia sets of graphs with a 2-separation
• Graphs whose positive semi-definite matrices have nullity at most two
• Positive semidefinite zero forcing
• Bounds for minimum semidefinite rank from superpositions and cutsets
• Decompositions of minimum rank matrices

This page was built for publication: On the maximum positive semi-definite nullity and the cycle matroid of graphs

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