Universal completability, least eigenvalue frameworks, and vector colorings

Chris Godsil, David E. Roberson, Brendan Rooney +2

An embedding $i\mapsto p_i\in {\mathbb{R}}^d$ of the vertices of a graph $G$ is called universally completable if the following holds: For any other embedding $i\mapsto q_i~\in \mat…