Controllability of path graphs by using information of second-order neighbors

This paper investigates the controllability of path graphs in undirected and connected networks. With any special control nodes, a sufficient condition is first derived for the controllability by taking advantage of the protocol of second-order neighbors. Then, with a specified constraint, a necessary and sufficient condition is established, respectively, for the single and multiple leaders.