A graph G is called a ________ if it is a connected acyclic graph.
A graph G is called a Tree if it is a connected acyclic graph.
A tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any acyclic connected graph is a tree. ∴ Tree is a connected graph that has no cycles. Forest is an acyclic graph. Every component of a forest is a tree.
A tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any acyclic connected graph is a tree.
∴ Tree is a connected graph that has no cycles. Forest is an acyclic graph. Every component of a forest is a tree.
64.3k questions
77.9k answers
244k comments
80.0k users
