The topological structure is mainly gives the representaion of the network. It is called as the heart of the topological structure. Following are the elements that are represented as the edges of the graph. Here the edges is drawn as a line , there are terminating on dots or small circles from which the edges (elements ) may be present. In the virtual circuit analysis the branches are mainly called from the edges of the graphs that is represented. There are various topologies present they are as follows : 1. Series topology 2.Parallel topology 3. Parallel series topology 4.series parallel topology The network topology is mainly explained in the form of the consept tree. The connected graph of a network mainly , a connected subgraph is known as the tree. As a result the topology that was formed is called as NETWORK TOPOLOGY. Here the grap as well subgraph mainly has the nodes , but there will not be any loops in it. Here the TWIGS , the branches of the tree are called as the twigs or tree branches. The number of tree branches are mainly lesser than the nodes that is present. Twigs = (n-1) , here \"n\" is the number of nodes of the graph. Also, the branches of the co - tree may not be interconnected , where as the branches of a tree are always remain connected. Here are the properties of the Tree: 1. In a Tree, there exists one and only one path between any pair of nodes. (there cannot be anyother path) 2. Alteast on tree will be there between every connected grwph. 3. A graph of the tree contains all the nodes. 4. The tree is mainly circuitless where there is no closed path in a tree. 5. (n-1) is called as rank of the tree. Solution The topological structure is mainly gives the representaion of the network. It is called as the heart of the topological structure. Following are the elements that are represented as the edges of the graph. Here the edges is drawn as a line , there are terminating on dots or small circles from which the edges (elements ) may be present. In the virtual circuit analysis the branches are mainly called from the edges of the graphs that is represented. There are various topologies present they are as follows : 1. Series topology 2.Parallel topology 3. Parallel series topology 4.series parallel topology The network topology is mainly explained in the form of the consept tree. The connected graph of a network mainly , a connected subgraph is known as the tree. As a result the topology that was formed is called as NETWORK TOPOLOGY. Here the grap as well subgraph mainly has the nodes , but there will not be any loops in it. Here the TWIGS , the branches of the tree are called as the twigs or tree branches. The number of tree branches are mainly lesser than the nodes that is present. Twigs = (n-1) , here \"n\" is the number of nodes of the graph. Also, the branches of the co - tree may not be interconnected , where as the branches of a tree are always remain connected. Here are the properties of the Tree: 1. In a Tree, there.

1. The topological structure is mainly gives the representaion of the network. It is called as the
heart of the topological structure. Following are the elements that are represented as the edges of
the graph.
Here the edges is drawn as a line , there are terminating on dots or small circles from which the
edges (elements ) may be present. In the virtual circuit analysis the branches are mainly called
from the edges of the graphs that is represented.
There are various topologies present they are as follows :
1. Series topology
2.Parallel topology
3. Parallel series topology
4.series parallel topology
The network topology is mainly explained in the form of the consept tree.
The connected graph of a network mainly , a connected subgraph is known as the tree. As a
result the topology that was formed is called as NETWORK TOPOLOGY.
Here the grap as well subgraph mainly has the nodes , but there will not be any loops in it.
Here the TWIGS , the branches of the tree are called as the twigs or tree branches.
The number of tree branches are mainly lesser than the nodes that is present.
Twigs = (n-1) , here "n" is the number of nodes of the graph.
Also, the branches of the co - tree may not be interconnected , where as the branches of a tree are
always remain connected.
Here are the properties of the Tree:
1. In a Tree, there exists one and only one path between any pair of nodes. (there cannot be
anyother path)
2. Alteast on tree will be there between every connected grwph.
3. A graph of the tree contains all the nodes.
4. The tree is mainly circuitless where there is no closed path in a tree.
5. (n-1) is called as rank of the tree.
Solution
The topological structure is mainly gives the representaion of the network. It is called as the
heart of the topological structure. Following are the elements that are represented as the edges of
the graph.
Here the edges is drawn as a line , there are terminating on dots or small circles from which the
edges (elements ) may be present. In the virtual circuit analysis the branches are mainly called

2. from the edges of the graphs that is represented.
There are various topologies present they are as follows :
1. Series topology
2.Parallel topology
3. Parallel series topology
4.series parallel topology
The network topology is mainly explained in the form of the consept tree.
The connected graph of a network mainly , a connected subgraph is known as the tree. As a
result the topology that was formed is called as NETWORK TOPOLOGY.
Here the grap as well subgraph mainly has the nodes , but there will not be any loops in it.
Here the TWIGS , the branches of the tree are called as the twigs or tree branches.
The number of tree branches are mainly lesser than the nodes that is present.
Twigs = (n-1) , here "n" is the number of nodes of the graph.
Also, the branches of the co - tree may not be interconnected , where as the branches of a tree are
always remain connected.
Here are the properties of the Tree:
1. In a Tree, there exists one and only one path between any pair of nodes. (there cannot be
anyother path)
2. Alteast on tree will be there between every connected grwph.
3. A graph of the tree contains all the nodes.
4. The tree is mainly circuitless where there is no closed path in a tree.
5. (n-1) is called as rank of the tree.