This paper examines cluster consensus for multi-agent systems on matrix-weighted switching networks. Necessary and/or sufficient conditions under which can be achieved are obtained, as well quantitative characterization of the steady-state consensus. Specifically, when underlying network switches amongst a finite number networks, necessary condition networks is derived; moreover, it shown that ...

A strongly connected digraph is called a cactoid-type if each of its blocks consisting finitely many oriented cycles sharing common directed path. In this article, we find...