Electrical Engineering ⇒ Topic : Network Topology
|
Gopal
| |
NETWORK TOPOLOGY Some Definitions Graph of network. The diagram that gives the network configuration and uses lines with very small circles at the ends to represent a network element is called graph of network. Tree. Any connected open set of branches which includes all nodes of a given graph is called tree. Theorem of Topology. The basic theorem of thpolo is given as: b=n+1-1 where b = number of branches, n = number of nodes, and I = number of independent loops. Cut-set. Cut-set is that set of elements that dissociates two main portions of a network such that replacing any element will destroy this property. Each cut-set contains one tree-branch, the remaining elements being tree links. Tree-branches connect all the nodes in the network | |
| |
!! OOPS Login [Click here] is required for more results / answer