☑Kizspy.me
(Choose 1 answer)
☐ A
Consider the following 2 definitions about graph:
An undirected graph is called connected when there is a path between any two vertices of the graph.
If every node u in undirected graph G is adjacent to every other node v in G, A graph is said to be complete.
Which of the following statements is correct:
A. The connected graph is always complete.
B. The complete graph is always connected.
C. The complete graph is always connected and vise versa.
D. None of others
Back
Next
FUQ.sh
sh the exam.
