Nodes with the same number of neighbors and multi-agent controllability

It was shown in the paper that for a multi-agent network under leader-follower framework, nodes with the same number of neighbors lead to uncontrollability when leaders come from complete cells. The result is based on the definition of complete cells and a partition of interconnection graph according to the same number of neighbors. In addition, it was proved that the multi-agent controllability is robust against connection variations between nodes in nontrivial cells.