A necessary and sufficient condition is derived for the controllability of Kronecker product
networks, where the factor networks are general directed graphs. The condition explicitly …

This paper tackles the eigenvalue allocation problem through an appropriate choice of the
edge weights for the class of combinatorially-symmetric Laplacian matrices of acyclic …

In this article, the discernibility of topological variations for networked linear time-invariant
(LTI) systems is investigated, where the network topology is general, and the nodes have …

We address the problem of identifying a network topology of a networked system for
maximizing a controllability measure, the average controllability under constraints on the …

In this paper, we bring forward a distributed algorithm for the assignment of a prescribed
Laplacian spectrum for path graphs by means of asymmetric weight assignment. We first …

A network of agents with linear dynamics is strong structurally controllable if agents can be
maneuvered from any initial state to any final state independently of the coupling strengths …

Principal submatrices of the controllability Gramian and their inverses are examined, for a
network-consensus model with inputs at a subset of network nodes. Several properties of …

The design of local state-feedback control systems in dynamical networks to block
observability at remote nodes is studied, in the context of a canonical linear network …

A condition for controllability of a network of diffusively coupled linear agents with sparse
actuation, which was developed in, is examined. An example is presented which …

In this article, we study the problem of computing a tight lower bound on the dimension of the
strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. The …