Skip to content
ml-recall

Graph Neural Networks

31 questions · 31 reviewed · Read the notes (5 min)

Timed test

20 questions · 20 min · score and explanations at the end

Take a test
Q 1 / 31Score 0 / 0

Question 1: Short answer

easyAI-checked

An undirected graph has N=6N = 6 nodes and ∣E∣=7|E| = 7 edges, with no self-loops and no repeated edges. A GCN works with A~=A+I\tilde A = A + I, the adjacency matrix with a self-loop added at every node. How many entries of the 6×66 \times 6 matrix A~\tilde A are non-zero?

a whole number