a tree is connected graph which has....
Answers
Answered by
2
Answer:
A connected acyclic graph is called a tree. In other words, a connected graph with no cycles is called a tree. The edges of a tree are known as branches. Elements of trees are called their nodes.
Step-by-step explanation:
here is your answer if you like my answer please follow
Answered by
3
Your Question is Incomplete!!
Similar questions