Abstract
AbstractThis article investigates the controllability of path and star graphs under the protocol of second-order neighbours. With identified special control nodes, a sufficient condition is first derived for the controllability of path graph by taking advantage of the protocol of second-order neighbours. Then necessary and sufficient conditions are developed respectively for the single and multiple leaders. Some differences between the protocol of second-order neighbours and first-order neighbours are also presented for path graph. Finally, a necessary and sufficient condition is proposed for the controllability of star graph by taking advantage of the protocol of second-order neighbours.
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 callMore From: IMA Journal of Mathematical Control and Information
Disclaimer: 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.
