The sum of elements in any row is always 1.

The smallest eigenvalue is always 0, with multiplicity equal to the number of connected components.

The matrix is always invertible for any graph with $n > 1$.

The sum of all eigenvalues is always 0.