Vertex-transitive closures of graphs

Abstract

A vertex-transitive closure of $Γ$ is a vertex-transitive supergraph of $Γ$ on the same vertex set. The vertex-transitive number of a graph $Γ$, denoted by $d_{vt}(Γ)$, is the smallest integer for which there exists a $d_{vt}(Γ)$-regular vertex-transitive closure of $Γ$. In this paper we use various algebraic and combinatorial methods to study vertex-transitive closures of graphs and the associated vertex-transitive number.