Abstract. In the paper we study the difference D(G)=W(G)-GP(G). We find infinitely many graphs which are not vertex-transitive and yet D(G)=0. We also completely characterize which values of D(G) are possible if G is a tree.