These are the values of the spectral separation (|λ1[A] / λ2[A]|) for all networks to which the statistic applies and for which it was computed. In total, it has been computed for 1,170 networks.
The spectral separation (|λ1[A] / λ2[A]|) equals the largest absolute eigenvalue of the adjacency matrix divided by the second largest absolute eigenvalue. The value is at least one. Larger values indicate "less diversity" in the network structure, in the sense that the adjacency matrix approaches a rank-one matrix. Low values (just slightly larger than one) indicate many independent substructures in the network; this can be interpreted as "more diversity", "more structure", or "more complexity".
The full definition of the spectral separation as well as its properties and relationships to other graph statistics can be found in the KONECT handbook.