Minimal controllability problem plays an important role in the field of network control. A New concept-Minimum Perfect Critical Set (MPCS)is proposed. Four different MPCSs were found for k-distant tree graphs. Based on this concept of MPCS, an algorithm for finding the minimal leader set is provided. Numerical experiments show that these theories enable the algorithm to find a minimal leader set with a probability of more than 0.98. Further, some other numerical characteristics of the minimal leader set of k-distant trees were found.
@article{arxiv.2202.02741,
title = {Minimal Leader Set for Controllability of k-distant Trees},
author = {Li Dai},
journal= {arXiv preprint arXiv:2202.02741},
year = {2022}
}
Comments
12pages. arXiv admin note: text overlap with arXiv:2112.01169, arXiv:1906.03384