Suppose (P, △) is an undirected graph without loops or multiple edges. We will denote by △ (x) the vertices adjacent to x and . Let (G, P) be a transitive permutation representation of a group G in a, set P, and Δ be a non-trivial self-paired (i.e. symmetric) orbit for the action of G on P X P. We identify △ with the set of all two subsets ﹛x, y﹜ with (x, y) in △. Then we have a graph (P, Δ) with G ≦ Aut (P, △), transitive on both P and △.