edited by
7,419 views

1 Answer

0 votes
0 votes

A graph G is called a Tree if it is a connected acyclic graph.

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.

edited by

Related questions

0 votes
0 votes
2 answers
1
gatecse asked Mar 2, 2018
737 views
Bluetooth uses ____ method in physical layer to avoid interference from other devices or other networksFHSSFDSSTDSNone of the above
0 votes
0 votes
1 answer
2
gatecse asked Mar 2, 2018
362 views
In which of the following search agent operates by interleaving computation and action?Offline searchOnline searchBreadth first searchDepth first search
0 votes
0 votes
1 answer
3
gatecse asked Mar 2, 2018
360 views
Which of the following deals with the precise model where accurate solutions are achieved quickly?Soft computingMobile computingHard computingNone of the above
0 votes
0 votes
1 answer
4
gatecse asked Mar 2, 2018
481 views
Supervised learning and unsupervised learning are two board category ofData warehouseDBMSNeural NetworkNone of the above