I wonder eigenvector of Laplacian Matrix

Recently, I study the Laplacian Matrix for partitioning graph.
Partitioning graph is required for Universal Sequence Rendering.

Laplacian matrix is adjacency matrix.

Diagonal entries are degree of graph node.
Nodiagonal entries are two value, 0 or -1..
If graph nodes are connected, Nodiagonal entry is -1, not is 0..

Laplacian matrix is symmetric.


Partitioning graph required a Laplacian matrix's eigenvector.


I read Spectral Graph Theory and its Applications in order to study laplacian matrix and it's eigenvector and eigenvalue