Minimal edge controllability of directed networks is investigated in this paper. A new edge dynamics model is first introduced with two nonzero parameters describing the linear relationship between the node states and the edge states. Three different digraphs as skeleton structures for minimal edge controllability are analyzed. The conditions ensuring both node controllability and edge controllability for these three digraphs are presented, respectively. It is found that cycles in these networks play an important role in edge controllability. The notion of minimal edge controllability is then extended to signed digraphs. It is shown that the minimal edge controllability of a signed cycle depends on the number of edges with negative weights, regardless of the placement of the negative weights on the edges. Some examples are presented for illustration and verification.
Discussion(0)
No comments yet. Be the first to comment.