Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2017/ii/paper-4/16h/iii/solution
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 4 16H iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-05
For a -regular undirected graph, its Graph Laplacian is , and for any complex vector ,If , the left side is zero, hence on every edge. In a connected graph all coordinates coincide. Thus the eigenspace is exactly the constant vectors, of dimension one. Since the adjacency matrix of a graph is symmetric and diagonalizable,
New to topics? Read the docs here!