Quotient-complete arc-transitive graphs

► We study G-symmetric graphs Γ whose normal quotients are complete or empty. ► We show that each G corresponds to a finite transitive linear group H. ► We construct all (Γ,G) with at least 3 complete quotients, for H≤ΓL(1,q). ► We determine which of the graphs constructed have diameter 2.