Question

Are these two tournaments on four vertices isomorphic?

score 993 · Answer 1 · 2019-08-25 19:01:40

993

Views

Are these two tournaments on four vertices isomorphic?

Published on 25 Aug 2019 - 19:01

score 63 · Answer 2 · 2019-08-26 18:03:23

63

Views

Property of directed graphs without quasi spanning tree structure

Published on 26 Aug 2019 - 18:03

score 29 · Answer 3 · 2026-03-25 14:19:40

29

Views

Visualizing directed edges without crossing

Published on 25 Mar 2026 - 14:19

score 1.9k · Answer 4 · 2026-03-25 07:56:49

1.9k

Views

Permutation matrix and simple directed graph

Published on 25 Mar 2026 - 7:56

score 981 · Answer 5 · 2026-03-25 00:42:13

981

Views

A game on a graph

Published on 25 Mar 2026 - 0:42

score 977 · Answer 6 · 2014-07-06 16:55:35

977

Views

Strongly regular tournament

Published on 06 Jul 2014 - 16:55

score 33 · Answer 7 · 2014-07-30 16:49:55

33

Views

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

Published on 30 Jul 2014 - 16:49

score 911 · Answer 8 · 2014-09-20 01:52:46

911

Views

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

Published on 20 Sep 2014 - 1:52

score 1.6k · Answer 9 · 2019-10-06 21:02:37

1.6k

Views

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

Published on 06 Oct 2019 - 21:02

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 109 · Answer 11 · 2019-10-13 12:33:41

109

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 13 Oct 2019 - 12:33

score 517 · Answer 12 · 2026-03-23 10:04:54

517

Views

About a strongly connected directed graph.

Published on 23 Mar 2026 - 10:04

score 1.3k · Answer 13 · 2019-11-06 19:32:36

1.3k

Views

draw the directed graph of the reflexive closure

Published on 06 Nov 2019 - 19:32

score 102 · Answer 14 · 2019-11-14 22:41:11

102

Views

Tree of shortest paths in weighted acyclic graph

Published on 14 Nov 2019 - 22:41

score 166 · Answer 15 · 2019-11-16 23:13:36

166

Views

Find maximum chain within a directed acyclic graph word problem.

Published on 16 Nov 2019 - 23:13

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