A graph Γ is said to be locally primitive if, for each vertex α, the stabilizer in Aut Γ of α induces a primitive permutation group on the set of vertices adjacent to α. In 1978, Richard Weiss conjectured that for a finite vertex-transitive locally primitive graph Γ, the number of automorphisms fixing a given vertex is bounded above by some function of the valency of Γ. In this paper we prove that the conjecture is true for finite non-bipartite graphsprovided that it is true in the case in which Aut Γ contains a locally primitive subgroup that is almost simple.