The eigenvectors don't depend on the convention above (for regular graphs), and are the same as for the averaging operator (as they differ by adding a multiple of the identity), though the eigenvalues differ according to the convention.
For operators that approximate the underlying continuous Laplacian the eigenvalues are a sequence of positive real numbers.