Pages that link to "Item:Q3624865"

The following pages link to On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph (Q3624865):

Displaying 44 items.

• Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors (Q314769) (← links)
• Matrices attaining the minimum semidefinite rank of a chordal graph (Q389640) (← links)
• Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
• On the graph complement conjecture for minimum semidefinite rank (Q551287) (← links)
• The minimum semidefinite rank of a triangle-free graph (Q630548) (← links)
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs (Q649553) (← links)
• Linearly independent vertices and minimum semidefinite rank (Q836992) (← links)
• Orthogonal representations, minimum rank, and graph complements (Q924328) (← links)
• Zero forcing parameters and minimum rank problems (Q975607) (← links)
• A note on universally optimal matrices and field independence of the minimum rank of a graph (Q977476) (← links)
• The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
• Lower bounds in minimum rank problems (Q1044621) (← 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 minimum number of distinct eigenvalues of a threshold graph (Q2133671) (← links)
• Vector representations of graphs and distinguishing quantum product states with one-way LOCC (Q2185850) (← links)
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues (Q2250939) (← links)
• A reduction procedure for the Colin de Verdière number of a graph (Q2309677) (← links)
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic (Q2317668) (← links)
• Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
• Orthogonal representations of Steiner triple system incidence graphs (Q2404398) (← links)
• Positive semidefinite zero forcing (Q2435453) (← links)
• Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
• Unitary matrix digraphs and minimum semidefinite rank (Q2477544) (← links)
• Minimum-rank matrices with prescribed graph (Q2564937) (← links)
• Line graphs: Their maximum nullities and zero forcing numbers (Q2828813) (← links)
• The Complexity of the Positive Semidefinite Zero Forcing (Q2942442) (← links)
• On the minimum semidefinite rank of a simple graph (Q3006563) (← links)
• On the minimum vector rank of multigraphs (Q3075173) (← links)
• On the maximum positive semi-definite nullity and the cycle matroid of graphs (Q3394468) (← links)
• Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
• A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
• Frame graph (Q4643723) (← links)
• Bounds on the sum of minimum semidefinite rank of a graph and its complement (Q4685893) (← links)
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
• Tree cover number and maximum semidefinite nullity of some graph classes (Q5139648) (← links)
• Bounds on minimum semidefinite rank of graphs (Q5175359) (← links)
• Determining the minimum rank of matroids whose basis graph is common (Q5300997) (← links)
• Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
• Graph complement conjecture for classes of shadow graphs (Q5862842) (← links)
• On the complexity of the positive semidefinite zero forcing number (Q5962481) (← links)
• The minimum rank problem for circulants (Q5962494) (← links)
• A note on a lower bound on the minimum rank of a positive semidefinite Hankel matrix rank minimization problem (Q6483890) (← links)
• Chordal graphs and distinguishability of quantum product states (Q6541336) (← links)