quasi-transitive

(graph theory, of a graph) Such that its vertex set can be partitioned into finitely many sets, so that there exists an automorphism mapping a vertex to another vertex if and only if the two vertices belong to the same set in that partition.