Question

A tree is an acyclic graph or graph having no cycles.
А
A True
B.
False​

Answer 1

Answer:

false graf also having cycles

Answer 2

Answer:

True

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.

Hope it helps

Follow me

40 ❤️ = Inbox