First-order network coherence in 5-rose graphs.

We consider first-order network coherence in 5-rose graphs with stochastic disturbances. Our analysis for first-order systems is facilitated by connections between first-order network coherence and the sum of reciprocals of all nonzero Laplacian eigenvalues. Our analysis reveals that 5-rose networks with small size have high network coherence and can be considered to be more robust to noise than networks with low coherence. The method used in this paper is practical and easy to handle. • The first-order network coherence in the 5-rose graphs is studied. • The 5-rose graphs is introduced. • Computing the roots of several small-degree polynomials. [ABSTRACT FROM AUTHOR]