Multiple Choice
Consider a digraph with the following vertices and edges: vertices: 1, 2, 3, 4
Edges: (1,2) , (2,1) , (3,4)
Which of the following statements are true?
A) The graph has a cycle
B) The graph is connected
C) The graph is acyclic
D) all of the above are true
E) neither a, b, nor c are true.
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q1: A complete graph on n vertices has
Q2: Consider the following undirected graph.<br>vertices: 1, 2,
Q3: A cycle is a path that starts
Q4: What is the difference between a spanning
Q5: An adjacency matrix is one approach to
Q7: Can an edge be part of more
Q8: Can a tree ever have a cycle?
Q9: A digraph and an directed graph are
Q10: A breadth-first traversal of a graph uses
Q11: A breadth-first traversal uses a stack as