The concept of consecutive-d digraph is proposed by Du, Hsu and Hwang. It generalizes the class of de Bruijn digraphs, the class of Imase-Itoh digraphs and the class of generalized de Bruijn graphs. The authors modify consecutive-d digraphs by connecting nodes with a loop into a circuit and deleting all loops. The result in this paper shows that the link-connectivity or the connectivity of modified consecutive-d digraphs get better.
