What are the properties of a tree in a network graph? 1. It consists of all the nodes of the graph. 2. If the graph has N number of nodes, the tree will have (N – 1) branches. 3. There will be only one closed path in the tree.
What are the properties of a tree in a network graph? 1. It consists of all the nodes of the graph. 2. If the graph has N number of nodes, the tree will have (N – 1) branches. 3. There will be only one closed path in the tree. Correct Answer 1 and 2 only
Tree: A tree is a subgraph of the main graph which connects all the nodes without forming a closed loop.
For a graph with ‘n’ nodes, the rank of tree = n – 1
Any tree for a given graph can be constructed with (n–1) branches.
Twig: The branch of a tree is called twig indicated by a thick line. Any tree with n nodes has (n–1) twigs.
Co-tree: The set of branches in a graph other than tree branches form a co tree.
Link: The branch of a co tree is called the link indicated by the dotted line. For any graph with n nodes and b branches, numbers of links = b – n + 1
Example:
A network with 4 nodes and corresponding graphical representation is represented below:
{{\left}^T}} \right|\) for just connected graph