On the maximum positive semi-definite nullity and the cycle matroid of graphs
From MaRDI portal
Publication:3394468
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
Cited in
(14)- Graphs whose positive semi-definite matrices have nullity at most two
- scientific article; zbMATH DE number 2202148 (Why is no real title available?)
- A new lower bound for the positive semidefinite minimum rank of a graph
- Minimum rank of outerplanar graphs
- On the tree cover number of a graph
- Zero forcing parameters and minimum rank problems
- The maximum corank of graphs with a 2-separation
- Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
- Bounds for minimum semidefinite rank from superpositions and cutsets
- Decompositions of minimum rank matrices
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- Positive semidefinite zero forcing
- Frame graph
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394468)