Abstract
This paper studies the controllability of multi-agent networks with antagonistic interactions, where signed graphs are used to represent such networks. By analyzing and abstracting definitions of equitable partitions of unsigned graphs and signed graphs, new definitions of an equitable partition and an almost equitable partition in the controllability of undirected signed graphs are proposed, which are the natural extension of unsigned graphs. The reasonability of the definitions is discussed in detail. Under this new partition, a new general necessary condition is proposed for controllability of undirected signed graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
