The adjacency matrix of a random cograph with 100k vertices, reordered according to a depth-first-search order of the leaves of the corresponding cotree to the right

The top row shows the adjacency matrices of uniformly generated cographs with 100, 1000, and 10 000 vertices. The middle rows show the same matrices, reordered according to a depth-first-search order of the corresponding cotrees. For comparison, the bottom row shows the adjancy matrices of uniformly generated random graphs.