Minimum leader selection for Structural Controllability of Undirected Graphs with Leader-follower Framework

Abstract

The optimization problem of the minimum set of leaders for the controllability of undirected graphs are addressed. It is difficult to find not only its optimal solution but also its approximate algorithm. We propose a new concept, namely minimal perfect critical set (MPCS), to obtain an optimal solution. Some properties are presented, and on the basis of these theorems, the problem of the minimum set of leaders of two typical self-similar bipartite networks, namely deterministic scale-free networks (DSFN) and Cayley trees, is solved completely.

arXiv commentarXiv admin note: text overlap with arXiv:1906.03384

References in corpus (5)

• Deterministic Scale-Free Networks
• Zero forcing sets and controllability of dynamical systems defined on graphs
• Zero forcing, linear and quantum controllability for systems evolving on networks
• Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
• Exactly solvable scale-free network model