Linearly independent vertices and minimum semidefinite rank

DOI10.1016/J.LAA.2009.03.030MaRDI QIDQ836992zbMATH OpenOpenAlexFDO

Authors Philip Hackney, Benjamin Harris, Margaret Lay, Lon H. Mitchell, S. K. Narayan, Amanda Pascoe Streib

Publication date 10 September 2009

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2009.03.030

zbMATH Keywords

joinminimum semidefinite ranklinearly independent vertices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Recommendations

• On the minimum semidefinite rank of a simple graph
• Bounds on minimum semidefinite rank of graphs
• On the minimum semidefinite rank of signed graphs
• Bounds for minimum semidefinite rank from superpositions and cutsets
• Bounds on the sum of minimum semidefinite rank of a graph and its complement

Cites work

• scientific article; zbMATH DE number 3838071 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1943970 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• A correction: Orthogonal representations and connectivity of graphs
• A survey of graph laplacians
• Graphs whose minimal rank is two
• Graphs whose positive semi-definite matrices have nullity at most two
• Maximum induced trees in graphs
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the Shannon capacity of a graph
• On the minimum rank of the join of graphs and decomposable graphs
• On the minimum semidefinite rank of a simple graph
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Orthogonal representations and connectivity of graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• Unitary matrix digraphs and minimum semidefinite rank
• Vector representations of graphs

Cited in

(28)

• Vector representations of graphs and distinguishing quantum product states with one-way LOCC
• Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
• Positive semidefinite zero forcing numbers of two classes of graphs
• Unitary matrix digraphs and minimum semidefinite rank
• Propagation tree decompositions and linearly independent vertices
• Frame graph
• Lower bounds in minimum rank problems
• Bounds on minimum semidefinite rank of graphs
• On the graph complement conjecture for minimum rank
• 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
• 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
• Zero forcing parameters and minimum rank problems
• On the minimum semidefinite rank of signed graphs
• On the complexity of the positive semidefinite zero forcing number
• The minimum rank of symmetric matrices described by a graph: a survey
• The inertia set of the join of graphs
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
• On the relationships between zero forcing numbers and certain graph coverings
• Zero forcing number, Grundy domination number, and their variants
• Chordal graphs and distinguishability of quantum product states
• Positive semidefinite zero forcing
• Bounds for minimum semidefinite rank from superpositions and cutsets

This page was built for publication: Linearly independent vertices and minimum semidefinite rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836992)