Question

Number of acyclic digraphs (DAGs) with n labelled nodes and r arcs

score 205 · Answer 1 · 2026-05-11 09:09:49

205

Views

Number of acyclic digraphs (DAGs) with n labelled nodes and r arcs

Published on 11 May 2026 - 9:09

score 93 · Answer 2 · 2026-05-03 11:12:05

93

Views

Determining set and Automorphism group of a graph

Published on 03 May 2026 - 11:12

score 110 · Answer 3 · 2026-04-13 20:37:25

110

Views

How many subgraphs of $K_{7,9}$ have 16 nodes and 16 edges?

Published on 13 Apr 2026 - 20:37

score 50 · Answer 4 · 2026-04-17 03:43:11

50

Views

Prove or disprove - graph cut

Published on 17 Apr 2026 - 3:43

score 94 · Answer 5 · 2026-04-15 23:04:26

94

Views

Homologous cycles on a directed graph

Published on 15 Apr 2026 - 23:04

score 224 · Answer 6 · 2026-04-13 22:17:40

224

Views

Fastest way to pick all unique pairs out of a range of numbers; if you could pick more than 2 at a time

Published on 13 Apr 2026 - 22:17

score 789 · Answer 7 · 2019-12-19 06:10:22

789

Views

Determine the chromatic polynomial of the given graph

Published on 19 Dec 2019 - 6:10

score 675 · Answer 8 · 2026-05-11 01:43:32

675

Views

prove that the graph $G$ is hamiltonian

Published on 11 May 2026 - 1:43

score 251 · Answer 9 · 2026-04-14 23:23:45

251

Views

Finding maximum cardinality subset of non-adjacent edges in the tree - in linear time?

Published on 14 Apr 2026 - 23:23

score 74 · Answer 10 · 2026-04-15 18:31:56

74

Views

How do you say this? $r(v|W)=(d(v,w_{1}),d(v,w_{2}),\dots ,d(v,w_{k}))$

Published on 15 Apr 2026 - 18:31

score 125 · Answer 11 · 2026-04-14 08:29:41

125

Views

How many ways are there to decompose a cycle into paths of given lengths?

Published on 14 Apr 2026 - 8:29

score 225 · Answer 12 · 2026-05-02 18:26:19

225

Views

An extension of the Utilities Problem. (for $n$ utilities) I want to find sufficient conditions to make it work.

Published on 02 May 2026 - 18:26

score 484 · Answer 13 · 2026-04-14 01:04:33

484

Views

Notation for length of path in a graph

Published on 14 Apr 2026 - 1:04

score 221 · Answer 14 · 2026-04-16 19:15:35

G is a simple undirected, connected graph with $\kappa$(G) < $\frac{n}{2}$. G has a simple path with 2$\kappa$(G) length.

score 113 · Answer 15 · 2026-04-15 07:02:31

113

Views

Elementary question on Graph Theory, Edge Contraction and Separability

Published on 15 Apr 2026 - 7:02

List Question

Number of acyclic digraphs (DAGs) with n labelled nodes and r arcs

Determining set and Automorphism group of a graph

How many subgraphs of $K_{7,9}$ have 16 nodes and 16 edges?

Prove or disprove - graph cut

Homologous cycles on a directed graph

Fastest way to pick all unique pairs out of a range of numbers; if you could pick more than 2 at a time

Determine the chromatic polynomial of the given graph

prove that the graph $G$ is hamiltonian

Finding maximum cardinality subset of non-adjacent edges in the tree - in linear time?

How do you say this? $r(v|W)=(d(v,w_{1}),d(v,w_{2}),\dots ,d(v,w_{k}))$

How many ways are there to decompose a cycle into paths of given lengths?

An extension of the Utilities Problem. (for $n$ utilities) I want to find sufficient conditions to make it work.

Notation for length of path in a graph

G is a simple undirected, connected graph with $\kappa$(G) < $\frac{n}{2}$. G has a simple path with 2$\kappa$(G) length.

Elementary question on Graph Theory, Edge Contraction and Separability

Trending Questions

Popular # Hahtags

Popular Questions