These are the values of the algebraic non-bipartivity (χ) for all networks to which the statistic applies and for which it was computed. In total, it has been computed for 319 networks.
The algebraic non-bipartivity (χ) is the smallest eigenvalue of the signless Laplacian matrix K = D + A. It is zero if and only if at least one connected component of the graph is bipartite. It serves as the basis for the spectral bipartite frustration, a measure of the bipartivity of a graph.
The full definition of the algebraic non-bipartivity as well as its properties and relationships to other graph statistics can be found in the KONECT handbook.
References for this statistic:
[1] | Jérôme Kunegis. Exploiting the structure of bipartite graphs for algebraic and spectral graph theory applications. Internet Math., 11(3):201–321, 2015. [ http ] |