AMA University Answers
Login
Register
AMA OED
Courses
CS
CS-6105
The number of simple digraphs...
The number of simple digraphs with |V | = 3 is
512
Correct
Similar CS-6105 questions
The minimum number of colors required in a proper vertex coloring of the graph.
The child of a child of a vertex is called
The square and the triangle are both green.
The square and the triangle are both blue.
The square is not blue or the triangle is green.
These are lines or curves that connect vertices.