Graph Signal Processing, Gsp, Signal Processing, Spectral Analysis, Fourier Transform.
diagonal element di will give the sum of the weights of all edges that touch the i-th vertex. This can be better understood using a ring graph as follows. Ring graph This ring graph has 8 vertices. So N = 8. It also has 8 edges. Let’s assume that each edge has a weight of 1. Then its weight matrix