Abstract
More and more attention has focused on consensus problem in the study of complex networks. Many researchers investigated consensus dynamics in a linear dynamical system with additive stochastic disturbances. In this paper, we construct iterated line graphs of multi-subdivision graph by applying multi-subdivided-line graph operation. It has been proven that the network coherence can be characterized by the Laplacian spectrum of network. We study the recursion formula of Laplacian eigenvalues of the graphs. After that, we obtain the scalings of the first- and second-order network coherence.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
