Question

How do you correctly reason that this directed graph is acyclic?

score 4.9k · Answer 1 · 2018-05-24 21:11:34

4.9k

Views

How do you correctly reason that this directed graph is acyclic?

Published on 24 May 2018 - 21:11

score 284 · Answer 2 · 2018-05-24 22:13:54

284

Views

Is this graph a tree and how do you reason it correctly?

Published on 24 May 2018 - 22:13

score 149 · Answer 3 · 2018-06-05 17:33:00

149

Views

Split hateful people into groups that can exist in harmony (color a graph)

Published on 05 Jun 2018 - 17:33

score 108 · Answer 4 · 2026-03-25 06:02:20

108

Views

a locally confluent and terminatting rewrite system is complete

Published on 25 Mar 2026 - 6:02

score 159 · Answer 5 · 2026-03-25 03:00:26

159

Views

incidence matrix of a mixed graph

Published on 25 Mar 2026 - 3:00

score 555 · Answer 6 · 2026-03-25 06:04:06

555

Views

Prove a DAG can be obtained by an undirected graph's longest cycle

Published on 25 Mar 2026 - 6:04

score 567 · Answer 7 · 2026-03-25 06:05:12

567

Views

Paths must cross in Lindström-Gessel-Viennot on the lattice

Published on 25 Mar 2026 - 6:05

score 92 · Answer 8 · 2026-03-25 07:45:44

92

Views

If an orientation of a tree graph has no source vertices, must the in-degree of each vertex in said orientation be equal to one?

Published on 25 Mar 2026 - 7:45

score 1.6k · Answer 9 · 2018-08-28 08:00:23

1.6k

Views

Blocking directed paths on a DAG with a linear number of vertex defects.

Published on 28 Aug 2018 - 8:00

score 998 · Answer 10 · 2018-09-09 08:53:16

998

Views

Connected digraph, the rank $M=V-1$

Published on 09 Sep 2018 - 8:53

score 311 · Answer 11 · 2018-09-09 20:20:33

311

Views

Minimum possible number of friendships

Published on 09 Sep 2018 - 20:20

score 221 · Answer 12 · 2026-03-25 03:04:13

221

Views

If $A$ is an adjacency matrix of a labeled multi-digraph is the $(i,j)^{th}$ coordinate of $A^n$ the number of directed $n$-walks from $i$ to $j$?

Published on 25 Mar 2026 - 3:04

score 537 · Answer 13 · 2026-03-25 04:59:34

537

Views

Say that a tournament T has 2-property, if for every distinct vertices u, w ∈ V ( T ), T has a (directed) u,w-path of length exactly 2.

Published on 25 Mar 2026 - 4:59

score 2.5k · Answer 14 · 2018-10-01 20:29:06

2.5k

Views

Graph theory - Shortest closed walk is a cycle?

Published on 01 Oct 2018 - 20:29

score 7k · Answer 15 · 2026-03-25 01:36:11

7k

Views

Laplacian of a directed weighted graph

Published on 25 Mar 2026 - 1:36

List Question

How do you correctly reason that this directed graph is acyclic?

Is this graph a tree and how do you reason it correctly?

Split hateful people into groups that can exist in harmony (color a graph)

a locally confluent and terminatting rewrite system is complete

incidence matrix of a mixed graph

Prove a DAG can be obtained by an undirected graph's longest cycle

Paths must cross in Lindström-Gessel-Viennot on the lattice

If an orientation of a tree graph has no source vertices, must the in-degree of each vertex in said orientation be equal to one?

Blocking directed paths on a DAG with a linear number of vertex defects.

Connected digraph, the rank $M=V-1$

Minimum possible number of friendships

If $A$ is an adjacency matrix of a labeled multi-digraph is the $(i,j)^{th}$ coordinate of $A^n$ the number of directed $n$-walks from $i$ to $j$?

Say that a tournament T has 2-property, if for every distinct vertices u, w ∈ V ( T ), T has a (directed) u,w-path of length exactly 2.

Graph theory - Shortest closed walk is a cycle?

Laplacian of a directed weighted graph

Trending Questions

Popular # Hahtags

Popular Questions