Highly regular vertex-transitive graphs are globally rigid

Angelo El Saliby

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its ve…