A correction: Orthogonal representations and connectivity of graphs
From MaRDI portal
Publication:1579514
DOI10.1016/S0024-3795(00)00091-4zbMath0954.05032MaRDI QIDQ1579514
Michael E. Saks, László Lovász, Alexander Schrijver
Publication date: 14 September 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (22)
Linearly independent vertices and minimum semidefinite rank ⋮ Maximum generic nullity of a graph ⋮ Techniques for determining equality of the maximum nullity and the zero forcing number of a graph ⋮ Positive matching decompositions of graphs ⋮ Generically globally rigid graphs have generic universally rigid frameworks ⋮ Vector representations of graphs and distinguishing quantum product states with one-way LOCC ⋮ On the graph complement conjecture for minimum rank ⋮ Hypergraph LSS-ideals and coordinate sections of symmetric tensors ⋮ Sparks of symmetric matrices and their graphs ⋮ The sheaf-theoretic structure of non-locality and contextuality ⋮ Three-connected graphs whose maximum nullity is at most three ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ Graph connectivity and universal rigidity of bar frameworks ⋮ Entanglement distillation from Greenberger-Horne-Zeilinger shares ⋮ Bounds on minimum semidefinite rank of graphs ⋮ Expected values of parameters associated with the minimum rank of a graph ⋮ Unextendible product bases ⋮ Embedding graphs in Euclidean space ⋮ Embedding graphs in Euclidean space ⋮ The minimum rank problem for circulants ⋮ Lower bounds in minimum rank problems ⋮ Sharp lower and upper bounds for the Gaussian rank of a graph
Cites Work
This page was built for publication: A correction: Orthogonal representations and connectivity of graphs
