Zero forcing number, constrained matchings and strong structural controllability
作者： Maguy Trefois , Jean-Charles Delvenne
DOI: 10.1016/J.LAA.2015.06.025
关键词:
摘要: Abstract The zero forcing number is a graph invariant introduced to study the minimum rank of graph. In 2008, Aazami proved NP-hardness computing simple undirected We complete this result by showing that non-equivalent problem directed allowing loops also NP-hard. rest paper devoted strong controllability networked system. This kind takes into account only structure interconnection graph, but not strengths along edges. provide necessary and sufficient condition in terms sets for system whose underlying loops. Moreover, we explain how our differs from recent related discovered Monshizadeh et al. Finally, show solve finding efficiently minimum-size input set self-damped with tree-structure.
core.ac.uk
arxiv.org
sci-hub.se 参考文章(31)
Ashkan Aazami, Hardness results and approximation algorithms for some problems on graphs University of Waterloo. ,(2008)
Airlie Chapman, Strong Structural Controllability of Networked Dynamics Semi-Autonomous Networks. pp. 135- 150 ,(2015) , 10.1007/978-3-319-15010-9_8
Amirreza Rahmani, Meng Ji, Mehran Mesbahi, Magnus Egerstedt, Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective Siam Journal on Control and Optimization. ,vol. 48, pp. 162- 186 ,(2009) , 10.1137/060674909
Chris Godsil, Simone Severini, Control by quantum dynamics on graphs Physical Review A. ,vol. 81, pp. 052316- ,(2010) , 10.1103/PHYSREVA.81.052316
G. Parlangeli, G. Notarstefano, On the Reachability and Observability of Path and Cycle Graphs IEEE Transactions on Automatic Control. ,vol. 57, pp. 743- 748 ,(2012) , 10.1109/TAC.2011.2168912
Shuo Zhang, M Kanat Camlibel, Ming Cao, None, Controllability of diffusively-coupled multi-agent systems with general and distance regular coupling topologies conference on decision and control. pp. 759- 764 ,(2011) , 10.1109/CDC.2011.6160658
Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks? IEEE Control Systems Magazine. ,vol. 32, pp. 66- 73 ,(2012) , 10.1109/MCS.2012.2195411
DD Olesky, Michael Tsatsomeros, P Van Den Driessche, None, Qualitative controllability and uncontrollability by a single entry Linear Algebra and its Applications. ,vol. 187, pp. 183- 194 ,(1993) , 10.1016/0024-3795(93)90134-A
Daniel Hershkowitz, Hans Schneider, Ranks of zero patterns and sign patterns Linear & Multilinear Algebra. ,vol. 34, pp. 3- 19 ,(1993) , 10.1080/03081089308818204
Waseem Abbas, Magnus Egerstedt, Ahmet Yasin Yazicioglu, A Tight Lower Bound on the Controllability of Networks with Multiple Leaders arXiv: Systems and Control. ,(2012) , 10.1109/CDC.2012.6426844