Laplacian Controllability for Graphs Obtained by Some Standard Products

Abstract

Let LG be the Laplacian matrix of a graph G with n vertices, and let b be a binary vector of length n. The pair (LG, b) is said to be controllable (and we also say that G is Laplacian controllable for b) if LG has no eigenvector orthogonal to b. In this paper we study the Laplacian controllability of joins, Cartesian products, tensor products and strong products of two graphs. Besides some theoretical results, we give an iterative construction of infinite families of controllable pairs (LG, b).