Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2017/ii/paper-4/16h/iii/solution

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!