Ononot — In a simple directed graph, if |V| = 6 and the graph is stro

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theoryhard

0:00.0

In a simple directed graph, if $|V| = 6$ and the graph is strongly connected, what is the minimum number of edges?