Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a single period. The theoretical results are illustrated with three examples.
Hou et al. (Thu,) studied this question.