Monday, July 14, 2014

A connected graph T without any cycles is called

A. a tree graph
B. free tree
C.   a tree
D. All of above

Ans: D


Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)