Graph Signal Processing, Fourier Transform, Graph Fourier Transform, Eigenvectors, Spectral Analysis.
following. Graph whose adjacency matrix is the circulant matrix Note that this is a directed graph. For an undirected graph, the adjacency matrix will be symmetric. Let’s denote it as A. We can define a degree matrix D as that contains information about the sum of weights of edges that are incident