Laplacian embedding of an uploaded small-world network. Laplacian embedding of a small-world network (n = 33) created by attaching complete subgraphs to nodes arrayed in a ring. The subgraphs each appear as a single point because their constituent nodes have identical connectivity profiles, yielding identical Laplacian eigenvector components.
Forman et al. BMC Bioinformatics 2005 6:260 doi:10.1186/1471-2105-6-260