A connected graph T without any cycles is called
A. a tree graph
B. free tree
C. a tree
D. All of above
Answer:A
A connected graph T without any cycles is called
A. a tree graph B. free tree C. a tree D. All of above