A connected graph T, which has no cycles, is known as __________.

1
A tree graph
2
A leave graph
3
A child graph
4
All of the above
5
None of above

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation