The Laplacian L = D − A encodes graph structure. Its eigenvectors reveal connectivity. The Fiedler vector (2nd smallest eigenvector) gives the best graph bisection.