Graph Signal Processing, Fourier Transform, Graph Fourier Transform, Eigenvectors, Spectral Analysis.
is the zero vector except for the entry m which is 1. Note that the final line in the above steps is similar to the following form. Now we have proven that for any filter matrix H that commutes with the adjacency matrix A of a graph, the eigenvectors are the same for H and A. Before introducing the