Pages that link to "Item:Q3394468"

The following pages link to On the maximum positive semi-definite nullity and the cycle matroid of graphs (Q3394468):

Displaying 14 items.

• Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors (Q314769) (← links)
• Decompositions of minimum rank matrices (Q389662) (← links)
• Bounds for minimum semidefinite rank from superpositions and cutsets (Q389675) (← links)
• Minimum rank of outerplanar graphs (Q417506) (← links)
• The inertia sets of graphs with a 2-separation (Q744118) (← links)
• Zero forcing parameters and minimum rank problems (Q975607) (← links)
• Graphs whose positive semi-definite matrices have nullity at most two (Q1414690) (← links)
• A new lower bound for the positive semidefinite minimum rank of a graph (Q1931723) (← links)
• Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs (Q2091787) (← links)
• On the tree cover number of a graph (Q2357664) (← links)
• Positive semidefinite zero forcing (Q2435453) (← links)
• The maximum corank of graphs with a 2-separation (Q2477537) (← links)
• Frame graph (Q4643723) (← links)
• (Q5314385) (← links)