On a class of multi-input laplacian controllable graphs

Abstract

In this paper we consider the Laplacian controllability problem of combining two special threshold graphs. We form this combination by connecting two identical and connected threshold graphs which have exactly one repeated degree. With appropriate selection of connecting vertices for combination we show how to use the minimum number of inputs to render the combined graph Laplacian controllable. Numerical examples are provided to demonstrate our work.