a tree is connected graph which has....
Answers
Answered by
16
Step-by-step explanation:
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.
Answered by
1
Answer:
A tree is an undirected graph G that satisfies any of the following equivalent conditions: G is connected and acyclic (contains no cycles). ... G is connected and the 3-vertex complete graph K3 is not a minor of G. Any two vertices in G can be connected by a unique simple path.
hope it helps you.............
Similar questions