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

DOI10.13001/1081-3810.1304zbMath1173.05031OpenAlexW2145459271MaRDI QIDQ3394468

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

zbMATH Keywords

graphsmatroidsnullityseparationpositive 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)

Related Items (9)

On the tree cover number of a graph ⋮ Decompositions of minimum rank matrices ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ A new lower bound for the positive semidefinite minimum rank of a graph ⋮ Minimum rank of outerplanar graphs ⋮ Positive semidefinite zero forcing ⋮ Frame graph ⋮ Zero forcing parameters and minimum rank problems ⋮ The inertia sets of graphs with a 2-separation

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