Vector representations of graphs
From MaRDI portal
Publication:584287
DOI10.1016/0012-365X(89)90171-4zbMath0693.05058OpenAlexW2095567216MaRDI QIDQ584287
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(89)90171-4
Related Items (18)
Subgraph complementation and minimum rank ⋮ Linearly independent vertices and minimum semidefinite rank ⋮ Faithful orthogonal representations of graphs from partition logics ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ A new lower bound for the positive semidefinite minimum rank of a graph ⋮ Graphs associated with vector spaces of even dimension: A link with differential geometry ⋮ Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph ⋮ Roots and (Re)sources of Value (In)definiteness Versus Contextuality ⋮ Unnamed Item ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ A note on vector representation of graphs ⋮ Sublinear update time randomized algorithms for dynamic graph regression ⋮ A combinatorial approach to complexity ⋮ Products of unit distance graphs ⋮ Time-dependent Lagrangian energy systems on supermanifolds with graph bundles ⋮ Lower bounds in minimum rank problems ⋮ On the theory of dynamic graph regression problem
Cites Work
- Hadamard graphs. I
- Graphs which contain all small graphs
- Graphs from projective planes
- Parallel concepts in graph theory
- Exoticn-universal graphs
- On the Shannon capacity of a graph
- On minimal n-universal graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Vector representations of graphs
