On the minimum semidefinite rank of a simple graph
From MaRDI portal
Publication:3006563
Recommendations
- Bounds on minimum semidefinite rank of graphs
- On the graph complement conjecture for minimum semidefinite rank
- The minimum semidefinite rank of a triangle-free graph
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- On the minimum semidefinite rank of signed graphs
- Bounds on the sum of minimum semidefinite rank of a graph and its complement
- A new lower bound for the positive semidefinite minimum rank of a graph
- On the graph complement conjecture for minimum rank
- On the minimum rank of a graph over finite fields
- An upper bound for the minimum rank of a graph
Cites work
- A survey of graph laplacians
- Computation of minimal rank and path cover number for certain graphs
- Converse to the Parter--Wiener theorem: the case of non-trees
- Graphs whose positive semi-definite matrices have nullity at most two
- Maximum induced trees in graphs
- Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
- Minimum-rank matrices with prescribed graph
- Olga, matrix theory and the Taussky unification problem
- On the Digraph of a Unitary Matrix
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- On the minimum rank of the join of graphs and decomposable graphs
- Orthogonal representations, minimum rank, and graph complements
- The minimum rank of symmetric matrices described by a graph: a survey
- Unitary matrix digraphs and minimum semidefinite rank
Cited in
(30)- Vector representations of graphs and distinguishing quantum product states with one-way LOCC
- Computing positive semidefinite minimum rank for small graphs
- Linearly independent vertices and minimum semidefinite rank
- Unitary matrix digraphs and minimum semidefinite rank
- Frame graph
- Lower bounds in minimum rank problems
- On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
- Bounds on minimum semidefinite rank of graphs
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- On the graph complement conjecture for minimum semidefinite rank
- Graph complement conjecture for classes of shadow graphs
- The minimum semidefinite rank of a triangle-free graph
- Orthogonal representations, minimum rank, and graph complements
- On the minimum rank among positive semidefinite matrices and tree size of a given graph of at most seven vertices
- The minimum rank problem for circulants
- On the minimum vector rank of multigraphs
- On the tree cover number of a graph
- Tree cover number and maximum semidefinite nullity of some graph classes
- A new lower bound for the positive semidefinite minimum rank of a graph
- Bounds on the sum of minimum semidefinite rank of a graph and its complement
- On the minimum semidefinite rank of signed graphs
- The minimum rank of symmetric matrices described by a graph: a survey
- On the minimum rank of a graph over finite fields
- Determining the minimum rank of matroids whose basis graph is common
- Orthogonal representations of Steiner triple system incidence graphs
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Chordal graphs and distinguishability of quantum product states
- Bounds for minimum semidefinite rank from superpositions and cutsets
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
This page was built for publication: On the minimum semidefinite rank of a simple graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3006563)