The Cayley Completion of a Graph

Rigobert Fokam Souop, Laurent Bitjoka

A finite connected graph is rarely a Cayley graph. We measure how far it is from being one: given $G$ with $n$ vertices and $m$ edges, how few edges must be added, or added and del…