A correction: Orthogonal representations and connectivity of graphs
From MaRDI portal
Recommendations
- Orthogonal representations and connectivity of graphs
- On orthogonal representations of graphs
- Corrigendum: Orthogonal Tree Decompositions of Graphs
- A note on orthogonal graphs
- scientific article; zbMATH DE number 4188691
- scientific article; zbMATH DE number 7692355
- Approximating the orthogonality dimension of graphs and hypergraphs
- Orthogonal \(\sigma\)-labellings of graphs
Cited in
(27)- Unextendible product bases
- Embedding graphs in Euclidean space
- Embedding graphs in Euclidean space
- Expected values of parameters associated with the minimum rank of a graph
- Lower bounds in minimum rank problems
- Correction to: ``On the expressive power of linear algebra on graphs
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC
- On the graph complement conjecture for minimum rank
- Sparks of symmetric matrices and their graphs
- Generically globally rigid graphs have generic universally rigid frameworks
- On the ideal of orthogonal representations of a graph in \(\mathbb{R}^2\)
- Positive matching decompositions of graphs
- Chordal graphs and distinguishability of quantum product states
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Maximum generic nullity of a graph
- Sharp lower and upper bounds for the Gaussian rank of a graph
- Linearly independent vertices and minimum semidefinite rank
- Graph connectivity and universal rigidity of bar frameworks
- Bounds on minimum semidefinite rank of graphs
- The sheaf-theoretic structure of non-locality and contextuality
- Obstructions to a general characterization of graph correspondences
- Entanglement distillation from Greenberger-Horne-Zeilinger shares
- Hypergraph LSS-ideals and coordinate sections of symmetric tensors
- The minimum rank problem for circulants
- Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
- Three-connected graphs whose maximum nullity is at most three
- Geometric representations of graphs
This page was built for publication: A correction: Orthogonal representations and connectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579514)
