Two vertices in a graph are ___________ if there is an edge connecting them.
A) Connected
B) Adjacent
C) Ordered
D) None of the above
Correct Answer:
Verified
Q1: An undirected graph is a graph where
Q3: An undirected graph is considered complete if
Q4: A _ is a sequence of edges
Q5: A _ is a path in which
Q6: An undirected tree is a connected, acyclic,
Q7: A directed graph, sometimes referred as a
Q8: A path in a directed graph is
Q9: A _, or a weighted graph, is
Q10: The only difference between a depth-first traversal
Q11: A graph is connected if and only
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents