Symmetric Covers and Pseudocovers of Complete Graphs

Abstract

We first characterize all faithful arc-transitive covers of complete graphs and we give a general construction of such covers. For a counterpart of cover, we say a graph $\Gamma$ is a pseudocover of its quotient $\Sigma$ if they have the same valency and $\Gamma$ is not a cover of $\Sigma$.As the second result of this paper, we prove that the complete graph $\K_n$ has a connected arc-transitive pseudocover if and only if $n-1$ is not a prime.

13 pages, 3 figures