Deep Learning, Artificial Intelligence, Self Supervised Learning, Semi Supervised Learning, Graph Laplacian.
Matrix A (Example from Here) Each 1 means the connection/edge between 2 nodes. (Some of the graphs will have value larger than 1, which is the weighting of the edge, which is also the case in this paper.) The degree matrix D of this graph is as follows: Degree Matrix D (Example from Here) Each