Algebraic characterization of observability in distance-regular consensus networks

Abstract

In this paper, we study the observability issue in consensus networks modeled with strongly regular graphs or distance regular graphs. We derive a Kalman-like simple algebraic criterion for observability in distance regular graphs. This criterion consists in evaluating the rank of a matrix built with the components of the Bose-Mesner algebra associated with the considered graph. Then, we state a simple necessary condition of observability based on parameters of the graph, namely the diameter, the degree, and the number of vertices of the graph.