A graph is said to be connected graph if-
A. only two nodes are connected
B. you cannot get from any node to any other node by following a sequence of borders
C. you can get from any node to any other node by following a sequence of edges
D. only three nodes are connected
Answer: Option C

Join The Discussion