Question

What is the motivation of the graph filter in the Graph Convolutional Networks?

score 68 · Answer 1 · 2026-03-26 06:29:44

68

Views

What is the motivation of the graph filter in the Graph Convolutional Networks?

Published on 26 Mar 2026 - 6:29

score 100 · Answer 2 · 2026-03-25 06:00:12

100

Views

GI-Completeness of graph isomorphism with connected graphs

Published on 25 Mar 2026 - 6:00

score 30 · Answer 3 · 2018-09-07 20:36:20

30

Views

Cycle notion in common tree definitions as undirected graphs

Published on 07 Sep 2018 - 20:36

score 190 · Answer 4 · 2018-09-08 03:52:55

190

Views

complete bipartite decomposition of a complete graph

Published on 08 Sep 2018 - 3:52

score 661 · Answer 5 · 2018-09-08 04:56:39

661

Views

Prove that if $G$ connected and $G$ becomes disconnected after removing any edge, then $G$ is a tree .

Published on 08 Sep 2018 - 4:56

score 1.1k · Answer 6 · 2018-09-08 05:48:59

1.1k

Views

If $G$ is a graph, $G$ is not connected, then there are at least $2$ connected components of $G$.

Published on 08 Sep 2018 - 5:48

score 228 · Answer 7 · 2026-03-25 02:59:28

228

Views

What properties does a graph whose adjacency matrix is invertible have?

Published on 25 Mar 2026 - 2:59

score 237 · Answer 8 · 2026-03-25 11:13:43

237

Views

The Fifth Power of a Special $8 \times 8$ Binary Matrix

Published on 25 Mar 2026 - 11:13

score 1000 · Answer 9 · 2026-03-27 06:58:43

1000

Views

Connected digraph, the rank $M=V-1$

Published on 27 Mar 2026 - 6:58

score 2.2k · Answer 10 · 2026-03-25 02:56:50

2.2k

Views

Node ordering permutation based adjacency matrix

Published on 25 Mar 2026 - 2:56

score 36 · Answer 11 · 2018-09-09 17:20:44

36

Views

Number of Directed Graphs with Degree Constraint

Published on 09 Sep 2018 - 17:20

score 313 · Answer 12 · 2026-03-27 05:20:33

313

Views

Minimum possible number of friendships

Published on 27 Mar 2026 - 5:20

score 68 · Answer 13 · 2018-09-10 01:03:45

68

Views

Fundamentals of Graph

Published on 10 Sep 2018 - 1:03

score 142 · Answer 14 · 2018-09-10 07:24:12

142

Views

Find a decomposition of K2n into two subgraphs G1 and G2 such that χ(G1) + χ(G2) = n+2.

Published on 10 Sep 2018 - 7:24

score 1.7k · Answer 15 · 2018-09-10 08:25:21

Prove that the deletion of edges of a minimum-edge cut of a connected graph G results in a disconnected graph with exactly two components.

List Question

What is the motivation of the graph filter in the Graph Convolutional Networks?

GI-Completeness of graph isomorphism with connected graphs

Cycle notion in common tree definitions as undirected graphs

complete bipartite decomposition of a complete graph

Prove that if $G$ connected and $G$ becomes disconnected after removing any edge, then $G$ is a tree .

If $G$ is a graph, $G$ is not connected, then there are at least $2$ connected components of $G$.

What properties does a graph whose adjacency matrix is invertible have?

The Fifth Power of a Special $8 \times 8$ Binary Matrix

Connected digraph, the rank $M=V-1$

Node ordering permutation based adjacency matrix

Number of Directed Graphs with Degree Constraint

Minimum possible number of friendships

Fundamentals of Graph

Find a decomposition of K2n into two subgraphs G1 and G2 such that χ(G1) + χ(G2) = n+2.

Prove that the deletion of edges of a minimum-edge cut of a connected graph G results in a disconnected graph with exactly two components.

Trending Questions

Popular # Hahtags

Popular Questions