Abstract
This study investigates on a strong correlation between complex network (CN) controllability (characterized by the number of required driver nodes) and graph symmetry (described by automorphism groups) in undirected and unweighted networks. Based on the properties of permutation products of elementary automorphisms, novel necessary conditions for CN controllability are presented which are computationally more effective than previous method. In addition, a novel index of symmetry is proposed upon which a more meaningful understanding of symmetry impact on CN controllability can be comprehended. Based on this new index, a modification strategy is suggested aiming to satisfy CN controllability with a lower number of driver nodes. The study shows that the proposed modification approach can result in a minimal set of driver nodes with a reasonable computational complexity. Further, the critical components of complex networks, in terms of their impact on the number of required driver nodes, are identified. The results of the proposed methodologies have been verified for several synthetic and real test systems including small, medium, and large power networks.
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.
