Minimum leader selection for Structural Controllability of Undirected Graphs with Leader-follower Framework
Optimization and Control
2021-12-03 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.2112.01169,
title = {Minimum leader selection for Structural Controllability of Undirected Graphs with Leader-follower Framework},
author = {Li Dai},
journal= {arXiv preprint arXiv:2112.01169},
year = {2021}
}
Comments
arXiv admin note: text overlap with arXiv:1906.03384