1.

A connected graph T without any cycles is called a ........

A. A tree graph
B. Free tree
C. A tree d
D. All of the above
Answer» E.


Discussion

No Comment Found