Algebraic connectivity of network-of-networks having a graph product structure

In this paper, we present a method for finding the algebraic connectivity of network-of-networks having a graph product structure. The network consists of several homogeneous (identical) subsystems connected with each other according to an interconnection graph. We show that the algebraic connectivity can be calculated from properties of graphs corresponding to the subsystem and the interconnection. Furthermore, we indicate that the algebraic connectivity of the entire system does not exceed those of the subsystem and the interconnection.