Graph Laplacian -3: Connected Components, Fiedler Vector

Connected components of a graph; Theorem: No. of connected components is equal to multiplicity of zero eigenvalue; Proof of the theorem; Fiedler value & Fiedler vector