1 / 21

Network topology, cut-set and loop equation

Network topology, cut-set and loop equation. 20050300 HYUN KYU SHIM. Definitions. Connected Graph : A lumped network graph is said to be connected if there exists at least one path among the branches (disregarding their orientation ) between any pair of nodes.

zahina
Download Presentation

Network topology, cut-set and loop equation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Network topology, cut-set and loop equation 20050300 HYUN KYU SHIM

  2. Definitions • Connected Graph : A lumped network graph is said to be connected if there exists at least one path among the branches (disregarding their orientation ) between any pair of nodes. • Sub Graph : A sub graph is a subset of the original set of graph branches along with their corresponding nodes.

  3. (A) Connected Graph (B) Disconnected Graph

  4. Cut – Set • Given a connected lumped network graph, a set of its branches is said to constitute a cut-set if its removal separates the remaining portion of the network into two parts.

  5. Tree • Given a lumped network graph, an associated tree is any connected subgraph which is comprised of all of the nodes of the original connected graph, but has no loops.

  6. Loop • Given a lumped network graph, a loop is any closed connected path among the graph branches for which each branch included is traversed only once and each node encountered connects exactly two included branches.

  7. Theorems • (a) A graph is a tree if and only if there exists exactly one path between an pair of its nodes. • (b) Every connected graph contains a tree. • (c) If a tree has n nodes, it must have n-1 branches.

  8. Fundamental cut-sets • Given an n - node connected network graph and an associated tree, each of the n -1 fundamental cut-sets with respect to that tree is formed of one tree branch together with the minimal set of links such that the removal of this entire cut-set of branches would separate the remaining portion of the graph into two parts.

  9. Fundamental cutset matrix

  10. Nodal incidence matrix The fundamental cutset equations may be obtained as the appropriately signed sum of the Kirchhoff `s current law node equations for the nodes in the tree on either side of the corresponding tree branch, we may always write (A is nodal incidence matrix)

  11. Loop incidence matrix Loop incidence matrix defined by

  12. Loop incidence matrix & KVL We define branch voltage vector We may write the KVL loop equations conveniently in vector – matrix form as

  13. General Case

  14. To obtain the cut set equations for an n-node , b-branch connected lumped network, we first write Kirchhoff `s law The close relation of these expressions with

  15. And current vector is specified as follows

  16. Hence, We obtain cutset equations

  17. Example

  18. hence the fundamental cutset matrix yields the cutset equations

  19. In this case we need only solve for the voltage function to obtain every branch variable.

More Related