Question

Prove that two graphs are isomorphic

score 56 · Answer 1 · 2026-03-26 03:19:03

56

Views

Prove that two graphs are isomorphic

Published on 26 Mar 2026 - 3:19

score 356 · Answer 2 · 2019-04-19 03:56:37

356

Views

How many nodes are there of each degree?

Published on 19 Apr 2019 - 3:56

score 85 · Answer 3 · 2019-04-19 08:31:52

85

Views

Is there a way to classify all power-invariant graphs?

Published on 19 Apr 2019 - 8:31

score 151 · Answer 4 · 2026-04-09 05:11:20

151

Views

Assigning people to jobs

Published on 09 Apr 2026 - 5:11

score 242 · Answer 5 · 2026-03-25 09:23:52

242

Views

Generalization of graph connectivity to edge cases (null graph, singleton graph)

Published on 25 Mar 2026 - 9:23

score 82 · Answer 6 · 2019-04-19 17:38:35

82

Views

Recursive formula for the definition of tree-depth of a graph

Published on 19 Apr 2019 - 17:38

score 41 · Answer 7 · 2026-04-02 02:33:57

41

Views

Examples to show that the edge-bound for no paths of length $k$ is best

Published on 02 Apr 2026 - 2:33

score 93 · Answer 8 · 2026-03-25 12:55:06

93

Views

Removing edges from a digraph to obtain the smallest digraph

Published on 25 Mar 2026 - 12:55

score 66 · Answer 9 · 2019-04-19 22:22:43

66

Views

Graph theory - number of spanning trees generalisation

Published on 19 Apr 2019 - 22:22

score 295 · Answer 10 · 2019-04-20 05:23:30

295

Views

Give edge set of graph with vertex set {a.b,c}

Published on 20 Apr 2019 - 5:23

score 116 · Answer 11 · 2019-04-20 05:54:44

116

Views

Visualizing a 2-torus on a planar shape using periodic boundary conditions

Published on 20 Apr 2019 - 5:54

score 81 · Answer 12 · 2019-04-20 08:51:09

81

Views

For what n,m the following conditon hold

Published on 20 Apr 2019 - 8:51

score 161 · Answer 13 · 2026-04-09 07:31:16

161

Views

How to prove there are unreachable states in this bit flipping algorithm only for lengths $n=3k+2$?

Published on 09 Apr 2026 - 7:31

score 252 · Answer 14 · 2019-04-20 11:20:57

252

Views

Can we decompose any connected Regular graph (or subclass of it) into Hamiltonian cycles and Perfect matchings?

Published on 20 Apr 2019 - 11:20

score 48 · Answer 15 · 2019-04-20 13:56:46

48

Views

Number of all possible sub-trees of m nodes of a given k-regular tree of n nodes.

Published on 20 Apr 2019 - 13:56

List Question

Prove that two graphs are isomorphic

How many nodes are there of each degree?

Is there a way to classify all power-invariant graphs?

Assigning people to jobs

Generalization of graph connectivity to edge cases (null graph, singleton graph)

Recursive formula for the definition of tree-depth of a graph

Examples to show that the edge-bound for no paths of length $k$ is best

Removing edges from a digraph to obtain the smallest digraph

Graph theory - number of spanning trees generalisation

Give edge set of graph with vertex set {a.b,c}

Visualizing a 2-torus on a planar shape using periodic boundary conditions

For what n,m the following conditon hold

How to prove there are unreachable states in this bit flipping algorithm only for lengths $n=3k+2$?

Can we decompose any connected Regular graph (or subclass of it) into Hamiltonian cycles and Perfect matchings?

Number of all possible sub-trees of m nodes of a given k-regular tree of n nodes.

Trending Questions

Popular # Hahtags

Popular Questions