Let G be an undirected graph. G is called ____ if any two vertices in G are connected.
A) weakly connected
B) completely connected
C) strongly connected
D) inversely connected
Correct Answer:
Verified
Q29: In a directed graph, the edges are
Q30: A _ is a path in which
Q31: A _ in G is a simple
Q32: Let G be an undirected graph. G
Q33: Let G be an undirected graph. A
Q35: The statement _ declares graphIt to be
Q36: The breadth first traversal of a graph
Q37: Let G be a weighted graph, let
Q38: Let G be a weighted graph, a
Q39: There are two well-known algorithms, _ algorithm
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