Golden Laplacian Graphs.

Many properties of the structure and dynamics of complex networks derive from the characteristics of the spectrum of the associated Laplacian matrix, specifically from the set of its eigenvalues. In this paper, we show that there exist graphs for which the ratio between the length of the spectrum (that is, the difference between the largest and smallest eigenvalues of the Laplacian matrix) and its spread (the difference between the second smallest eigenvalue and the smallest one) is equal to the golden ratio. We call such graphs Golden Laplacian Graphs (GLG). In this paper, we first find all such graphs with a number of nodes n ≤ 10 . We then prove several graph-theoretic and algebraic properties that characterize these graphs. These graphs prove to be extremely robust, as they have large vertex and edge connectivity along with a large isoperimetric constant. Finally, we study the synchronization properties of GLGs, showing that they are among the top synchronizable graphs of the same size. Therefore, GLGs represent very good candidates for engineering and communication networks. [ABSTRACT FROM AUTHOR]