... in the case d > 1, the digraphD∗G,Mis of type T± and has properties 4− and 3+. Thus the (4−, 3+)-entry of the tablecorresponding to the type T±is Y as well. The proof of the ... partitions of theirvertex sets. If D is digraph and τ a partition of V (D), then the vertex set of the quotientgraph D/τ is given by the sets of τ, and, for vertices uτ and vτ of D/τ , (uτ, ... directed tree of in-degree > 1 and of out-degree > 1 is of type T± and has properties 5− and 5+simultane-ously. Furthermore, let DG,Mbe the Cayley digraph defined in the proof of Theorem...