Let G be an undirected graph. G is called ____ if there is a path from any vertex to any other vertex.
A) attached
B) converted
C) completed
D) connected
Correct Answer:
Verified
Q27: When drawing a graph, a _ inside
Q28: In an undirected graph, the edges are
Q29: In a directed graph, the edges are
Q30: A _ is a path in which
Q31: A _ in G is a simple
Q33: Let G be an undirected graph. A
Q34: Let G be an undirected graph. G
Q35: The statement _ declares graphIt to be
Q36: The breadth first traversal of a graph
Q37: Let G be a weighted graph, let
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