An approach for constructing single-leader controllable networked systems

For a networked system governed by the consensus algorithm, its controllability can be transformed into the controllability of two kinds of systems. The controllability equivalence of the two systems is proved. Utilizing this property, a novel approach for constructing single-leader controllable networked systems is presented. We also investigate the controllability of a graph when two nodes are added to an original node. Moreover, the controllability of a special class of graph is studied as well.