Which of the following is not true for tree and graph?a)A tree is a gr...
Tree:
A tree is a connected subgraph of a connected graph containing all the nodes of the graph but containing no loops, i.e., there is a unique path between every pair of nodes.
The number of closed paths in a tree of the graph is zero. Therefore is not true for tree and graph.
Twig: The branches of the tree are called twigs.
Link: Those branches of the graph which are not in the tree.
Co-tree: All the links of a tree together constitute complement of the tree and is called co-tree, in which the number of branches is equal to b - (n - 1)
Where b is the number of branches of the graph.
Number of twigs: t = n - 1
Number of links: L = b - t = b – n + 1