No student devices needed. Know more
7 questions
Which of the following are NOT valid graph categories?
Static (Known is another valid category)
Fixed
Varied
Unknown
Consider a graph G, is there a fixed ordering of neighbours?
No
Yes
Consider the Graph in the figure below.
What would be the diagonal elements of its degree matrix?
4-3-2-3-3-1
4-2-3-3-3-1
4-3-3-1-2-1
4-3-3-3-3-1
Choose the correct multiple answers.
Graph Laplacian is:
Permutation Invariant
Isotropic
Shift invariant
Anisotropic
In ChebNet under the assumptions of sparse Laplacians, the complexity of learnable parameters is:
O(n)
O(n^2)
O(1)
O(n log n)
In which of the following cases, does a mean function aggregator NOT fail (colours represent different feature values):
1
2
3
They all fail :(
In which of the following cases, does a max function aggregator NOT fail (colours represent different feature values)
1
2
3
They all fail :(
Explore all questions with a free account