Question

Counting the number of minimal connected supergraphs of an arbitrary disconnected digraph

score 101 · Answer 1 · 2026-04-14 03:19:21

101

Views

Counting the number of minimal connected supergraphs of an arbitrary disconnected digraph

Published on 14 Apr 2026 - 3:19

score 133 · Answer 2 · 2026-04-23 04:13:39

133

Views

For any sets $X$ & $Y$ can the group of automorphisms for the digraph $G(X,Y)=(X\cup Y,X\times Y)$ be express in terms of symmetric groups?

Published on 23 Apr 2026 - 4:13

score 21 · Answer 3 · 2026-04-16 04:33:17

21

Views

Attribute the final output value of a directed graph proportionally to its vertices

Published on 16 Apr 2026 - 4:33

score 129 · Answer 4 · 2026-04-15 02:55:17

129

Views

Digraph vertices: classification by counting outgoing walks

Published on 15 Apr 2026 - 2:55

score 45 · Answer 5 · 2026-04-13 21:50:32

45

Views

Graphs, at-most-one-intermediate paths and induction

Published on 13 Apr 2026 - 21:50

score 220 · Answer 6 · 2026-05-10 11:38:00

220

Views

Minimize the maximum value returned by paths of an oriented graph in a minimum of transformations

Published on 10 May 2026 - 11:38

score 1.9k · Answer 7 · 2026-04-28 21:32:56

1.9k

Views

How to find Eulerian path in the given graph?

Published on 28 Apr 2026 - 21:32

score 183 · Answer 8 · 2026-05-01 08:19:38

183

Views

Relationship between graphs describing horizontal and vertical cell network

Published on 01 May 2026 - 8:19

score 45 · Answer 9 · 2026-04-12 06:02:51

45

Views

How to build and operate with floor plan trees/graphs

Published on 12 Apr 2026 - 6:02

score 62 · Answer 10 · 2026-04-22 10:12:37

62

Views

Finding necessary/sufficient conditions for when a directed graph's geodesic function is unbounded.

Published on 22 Apr 2026 - 10:12

score 34 · Answer 11 · 2026-04-17 08:54:49

34

Views

Name of a digraph such that all its vertices are carriers?

Published on 17 Apr 2026 - 8:54

score 668 · Answer 12 · 2026-04-14 09:23:49

668

Views

Prove: If tournament $T$ is transitive, then every two vertices of $T$ have distinct outdegrees.

Published on 14 Apr 2026 - 9:23

score 147 · Answer 13 · 2026-03-25 08:03:37

147

Views

Do half-iterate functions exist for any function?

Published on 25 Mar 2026 - 8:03

score 486 · Answer 14 · 2026-04-14 19:32:02

486

Views

Connectedness in Directed Graphs

Published on 14 Apr 2026 - 19:32

score 58 · Answer 15 · 2026-04-17 11:25:47

58

Views

How to compute the maximum number of flights possible

Published on 17 Apr 2026 - 11:25

List Question

Counting the number of minimal connected supergraphs of an arbitrary disconnected digraph

For any sets $X$ & $Y$ can the group of automorphisms for the digraph $G(X,Y)=(X\cup Y,X\times Y)$ be express in terms of symmetric groups?

Attribute the final output value of a directed graph proportionally to its vertices

Digraph vertices: classification by counting outgoing walks

Graphs, at-most-one-intermediate paths and induction

Minimize the maximum value returned by paths of an oriented graph in a minimum of transformations

How to find Eulerian path in the given graph?

Relationship between graphs describing horizontal and vertical cell network

How to build and operate with floor plan trees/graphs

Finding necessary/sufficient conditions for when a directed graph's geodesic function is unbounded.

Name of a digraph such that all its vertices are carriers?

Prove: If tournament $T$ is transitive, then every two vertices of $T$ have distinct outdegrees.

Do half-iterate functions exist for any function?

Connectedness in Directed Graphs

How to compute the maximum number of flights possible

Trending Questions

Popular # Hahtags

Popular Questions