Q.

A connected graph T without any cycles is called

A. tree graph
B. free tree
C. tree
D. All of the above
Answer» D. All of the above

Discussion

No comments yet