Skip to content
ml-recall

#graph-laplacian

1 question from Clustering

Timed test

1 question · 1 min · score and explanations at the end

Take a test
Q 1 / 1Score 0 / 0

Question 1: Short answer

mediumAI-checkedClustering

The square graph has 4 nodes in a cycle (each node joined to two neighbours). Its Laplacian is L=D−AL = D - A (degree matrix minus adjacency matrix). What is the second-smallest eigenvalue of LL?

a number