A generalized p-cycle is a digraph whose set of vertices is partitioned in p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only to vertices in the next part. In this work, we mainly show the two following types of conditions in order to find generalized p-cycles with maximum connectivity: 1. For a new given parameter `, related to the number of short...