TY - JOUR
T1 - Algebraic connectivity of network-of-networks having a graph product structure
AU - Lee, Hojin
AU - Nguyen, Linh Thi Hoai
AU - Fujisaki, Yasumasa
N1 - Funding Information:
This work was supported by CREST Grant Number JPMJCR15K2, Japan Science and Technology Agency.
Publisher Copyright:
© 2017 Elsevier B.V.
PY - 2017/6/1
Y1 - 2017/6/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85018624484&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85018624484&partnerID=8YFLogxK
U2 - 10.1016/j.sysconle.2017.03.003
DO - 10.1016/j.sysconle.2017.03.003
M3 - Article
AN - SCOPUS:85018624484
SN - 0167-6911
VL - 104
SP - 15
EP - 20
JO - Systems and Control Letters
JF - Systems and Control Letters
ER -