I am trying to write a clustering method for a similarity matrix of a graph and i need a way to compute the smallest ev/ews of a laplacian matrix. I know that the smallest ew is 0 and the corresponding ev is a Nx1 vector of 1s where N is the size of the laplacian.
Thanks,

