On the minimum semidefinite rank of a simple graph

DOI10.1080/03081080903542791zbMath1223.05170OpenAlexW2045482152MaRDI QIDQ3006563

Terry D. Lenker, Philip Hackney, Sivaram K. Narayan, Margaret Lay, Matt Booth, Brian D. Sutton, Charles R. Johnson, Benjamin Harris, Lon H. Mitchell, Amanda Pascoe Streib

Publication date: 20 June 2011

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080903542791

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)

Related Items (19)

On the tree cover number of a graph ⋮ On the minimum semidefinite rank of signed graphs ⋮ Linearly independent vertices and minimum semidefinite rank ⋮ Unnamed Item ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ Vector representations of graphs and distinguishing quantum product states with one-way LOCC ⋮ A new lower bound for the positive semidefinite minimum rank of a graph ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ Orthogonal representations, minimum rank, and graph complements ⋮ Frame graph ⋮ Unitary matrix digraphs and minimum semidefinite rank ⋮ Bounds on minimum semidefinite rank of graphs ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ The minimum rank problem for circulants ⋮ The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic ⋮ Unnamed Item ⋮ Lower bounds in minimum rank problems ⋮ Graph complement conjecture for classes of shadow graphs

Cites Work

• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• Converse to the Parter--Wiener theorem: the case of non-trees
• 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
• Maximum induced trees in graphs
• Olga, matrix theory and the Taussky unification problem
• Graphs whose positive semi-definite matrices have nullity at most two
• Computation of minimal rank and path cover number for certain graphs
• Unitary matrix digraphs and minimum semidefinite rank
• Minimum-rank matrices with prescribed graph
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the Digraph of a Unitary Matrix
• A survey of graph laplacians

This page was built for publication: On the minimum semidefinite rank of a simple graph