Bounds on minimum semidefinite rank of graphs

DOI10.1080/03081087.2014.898763zbMath1307.05148OpenAlexW2051420548MaRDI QIDQ5175359

Sivaram K. Narayan, Yousra Sharawi

Publication date: 20 February 2015

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

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

zbMATH Keywords

independence numberminimum semidefinite rankdelta conjecturematrix of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (1)

Unnamed Item

Cites Work

• On the graph complement conjecture for minimum semidefinite rank
• Linearly independent vertices and minimum semidefinite rank
• An upper bound for the minimum rank of a graph
• Zero forcing parameters and minimum rank problems
• Lower bounds in minimum rank problems
• Graphs whose positive semi-definite matrices have nullity at most two
• A correction: Orthogonal representations and connectivity of graphs
• Orthogonal representations and connectivity of graphs
• Minimum-rank matrices with prescribed graph
• On the minimum semidefinite rank of a simple graph
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• A survey of graph laplacians

This page was built for publication: Bounds on minimum semidefinite rank of graphs