Question
What is the central idea of spectral graph partitioning?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Use eigenvectors of a graph-related matrix to embed and separate vertices
Explanation:
Spectral methods use eigenstructure of matrices such as the graph Laplacian to reveal global connectivity patterns. A selected eigenvector can guide a cut or lower-dimensional graph embedding.
Leave a Reply