Abstract
In this work we study the Laplacian controllability of a class of connected simple graphs. Consider two $k -$ vertex threshold graphs, each with its own unique repeated degree. Suppose the multiplicities of the repeated degrees in the first and second graphs are m 1 and m 2 respectively, where $m_{1}\geq$ m 2 . If the two threshold graphs are interconnected via a new edge, it is shown that the minimum number of controllers to render the resulting graph Laplacian controllable is $m_{1}-1$ if $m_{1} \gt $ m 2 , and is $2 m_{1}-3$ otherwise. The method to add this new edge and to connect these controllers to ensure the controllability is presented. Numerical examples are provided to illustrate our results.
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.
