These are the values of the algebraic connectivity (a) for all networks to which the statistic applies and for which it was computed. In total, it has been computed for 1,129 networks.
The algebraic connectivity (a) of a network is the second smallest eigenvalue of the Laplacian matrix of the network, the smallest eigenvalue being zero. Only the network's largest connected component is considered, and all edge weights, directions, and multiplicities are ignored.
The full definition of the algebraic connectivity as well as its properties and relationships to other graph statistics can be found in the KONECT handbook.
References for this statistic:
[1] | Miroslav Fiedler. Algebraic connectivity of graphs. Czechoslov. Math. J., 23(98):298–305, 1973. |