The algebraic connectivity of a graph G is greater than 0 if and only if G is a connected graph.
In models of synchronization on networks, such as the Kuramoto model, the Laplacian matrix arises naturally, so the algebraic connectivity gives an indication of how easily the network will synchronize [REF].