Question

Are these two tournaments on four vertices isomorphic?

score 996 · Answer 1 · 2026-04-14 00:23:47

996

Views

Are these two tournaments on four vertices isomorphic?

Published on 14 Apr 2026 - 0:23

score 66 · Answer 2 · 2026-04-12 02:45:06

66

Views

Property of directed graphs without quasi spanning tree structure

Published on 12 Apr 2026 - 2:45

score 30 · Answer 3 · 2026-04-12 10:27:58

30

Views

Visualizing directed edges without crossing

Published on 12 Apr 2026 - 10:27

score 1.9k · Answer 4 · 2026-04-16 12:55:16

1.9k

Views

Permutation matrix and simple directed graph

Published on 16 Apr 2026 - 12:55

score 983 · Answer 5 · 2026-04-14 23:57:25

983

Views

A game on a graph

Published on 14 Apr 2026 - 23:57

score 981 · Answer 6 · 2026-05-10 13:34:10

981

Views

Strongly regular tournament

Published on 10 May 2026 - 13:34

score 36 · Answer 7 · 2026-04-12 15:09:15

36

Views

Which terms are used for the digraph of the edges of a digraph?

Published on 12 Apr 2026 - 15:09

score 914 · Answer 8 · 2026-04-15 10:38:05

914

Views

How many directed graphs of size n are there where each vertex is the tail of exactly one edge?

Published on 15 Apr 2026 - 10:38

score 1.6k · Answer 9 · 2026-05-10 14:27:20

1.6k

Views

How to prove that the Laplacian for a directed graph has an eigenvalue at 0?

Published on 10 May 2026 - 14:27

score 227 · Answer 10 · 2019-10-09 17:43:14

227

Views

Does this theorem have a name, and where can I find a proof? "Every finite, weakly connected digraph contains at least one source or cycle."

Published on 09 Oct 2019 - 17:43

score 111 · Answer 11 · 2026-04-28 20:46:54

111

Views

Proving there is a minimally strong digraph with $n$ vertices and $m$ arcs for all $n,m\in\mathbb{Z}$ such that $2\leq n\leq m\leq 2n−2$?

Published on 28 Apr 2026 - 20:46

score 527 · Answer 12 · 2026-05-04 08:49:57

527

Views

About a strongly connected directed graph.

Published on 04 May 2026 - 8:49

score 1.3k · Answer 13 · 2026-03-30 12:00:09

1.3k

Views

draw the directed graph of the reflexive closure

Published on 30 Mar 2026 - 12:00

score 103 · Answer 14 · 2026-03-28 03:06:31

103

Views

Tree of shortest paths in weighted acyclic graph

Published on 28 Mar 2026 - 3:06

score 168 · Answer 15 · 2026-04-23 12:39:07

168

Views

Find maximum chain within a directed acyclic graph word problem.

Published on 23 Apr 2026 - 12:39

List Question

Are these two tournaments on four vertices isomorphic?

Property of directed graphs without quasi spanning tree structure

Visualizing directed edges without crossing

Permutation matrix and simple directed graph

A game on a graph

Strongly regular tournament

Which terms are used for the digraph of the edges of a digraph?

How many directed graphs of size n are there where each vertex is the tail of exactly one edge?

How to prove that the Laplacian for a directed graph has an eigenvalue at 0?

Does this theorem have a name, and where can I find a proof? "Every finite, weakly connected digraph contains at least one source or cycle."

Proving there is a minimally strong digraph with $n$ vertices and $m$ arcs for all $n,m\in\mathbb{Z}$ such that $2\leq n\leq m\leq 2n−2$?

About a strongly connected directed graph.

draw the directed graph of the reflexive closure

Tree of shortest paths in weighted acyclic graph

Find maximum chain within a directed acyclic graph word problem.

Trending Questions

Popular # Hahtags

Popular Questions