Question

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

score 98 · Answer 1 · 2018-03-18 03:18:04

98

Views

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

Published on 18 Mar 2018 - 3:18

score 127 · Answer 2 · 2026-03-17 05:15:06

127

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 17 Mar 2026 - 5:15

score 18 · Answer 3 · 2018-03-22 07:51:50

18

Views

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

Published on 22 Mar 2018 - 7:51

score 127 · Answer 4 · 2018-03-30 12:31:46

127

Views

Digraph vertices: classification by counting outgoing walks

Published on 30 Mar 2018 - 12:31

score 42 · Answer 5 · 2026-03-22 19:57:36

42

Views

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

Published on 22 Mar 2026 - 19:57

score 213 · Answer 6 · 2026-03-22 16:53:48

213

Views

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

Published on 22 Mar 2026 - 16:53

score 1.9k · Answer 7 · 2026-03-22 07:44:41

1.9k

Views

How to find Eulerian path in the given graph?

Published on 22 Mar 2026 - 7:44

score 177 · Answer 8 · 2026-03-22 10:16:21

177

Views

Relationship between graphs describing horizontal and vertical cell network

Published on 22 Mar 2026 - 10:16

score 42 · Answer 9 · 2026-03-22 16:25:19

42

Views

How to build and operate with floor plan trees/graphs

Published on 22 Mar 2026 - 16:25

score 57 · Answer 10 · 2026-03-24 22:42:50

57

Views

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

Published on 24 Mar 2026 - 22:42

score 29 · Answer 11 · 2018-04-24 12:52:19

29

Views

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

Published on 24 Apr 2018 - 12:52

score 665 · Answer 12 · 2018-05-01 13:49:52

665

Views

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

Published on 01 May 2018 - 13:49

score 146 · Answer 13 · 2026-03-24 22:59:31

146

Views

Do half-iterate functions exist for any function?

Published on 24 Mar 2026 - 22:59

score 482 · Answer 14 · 2026-03-22 05:16:16

482

Views

Connectedness in Directed Graphs

Published on 22 Mar 2026 - 5:16

score 53 · Answer 15 · 2026-03-22 16:25:06

53

Views

How to compute the maximum number of flights possible

Published on 22 Mar 2026 - 16: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