System topology, cut-set and circle comparison

0
0
1735 days ago, 594 views
PowerPoint PPT Presentation
Definitions. Associated Graph : A lumped system diagram is said to be joined if there exists no less than one way among the branches (neglecting their introduction ) between any pair of nodes.Sub Graph : A sub chart is a subset of the first arrangement of diagram branches alongside their comparing hubs..

Presentation Transcript

Slide 1

﻿Arrange topology, cut-set and circle condition 20050300 HYUN KYU SHIM

Slide 2

Definitions Connected Graph : A lumped organize diagram is said to be associated if there exists no less than one way among the branches (slighting their introduction ) between any match of hubs. Sub Graph : A sub diagram is a subset of the first arrangement of chart branches alongside their relating hubs.

Slide 3

(A) Connected Graph (B) Disconnected Graph

Slide 4

Cut – Set Given an associated lumped organize diagram, an arrangement of its branches is said to constitute a cut-set if its evacuation isolates the rest of the segment of the system into two sections.

Slide 5

Tree Given a lumped arrange chart, a related tree is any associated subgraph which is included the greater part of the hubs of the first associated diagram, however has no circles.

Slide 6

Loop Given a lumped organize diagram, a circle is any shut associated way among the chart branches for which each branch included is crossed just once and every hub experienced interfaces precisely two included branches.

Slide 7

Theorems (an) A diagram is a tree if and just if there exists precisely one way between a sets of its hubs. (b) Every associated chart contains a tree. (c) If a tree has n hubs, it must have n-1 branches.

Slide 8

Fundamental cut-sets Given a n - hub associated organize chart and a related tree, each of the n - 1 major slice sets regarding that tree is framed of one tree limb together with the negligible arrangement of connections to such an extent that the evacuation of this whole cut-arrangement of branches would isolate the rest of the bit of the diagram into two sections.

Slide 9

Fundamental cutset lattice

Slide 10

Nodal rate framework The major cutset conditions might be gotten as the suitably marked entirety of the Kirchhoff `s current law hub conditions for the hubs in the tree on either side of the comparing tree limb, we may dependably compose (An is nodal occurrence grid)

Slide 11

Loop rate framework Loop rate lattice characterized by

Slide 12

Loop frequency grid & KVL We characterize branch voltage vector We may compose the KVL circle conditions advantageously in vector – network shape as

Slide 13

General Case

Slide 15

To get the cut set conditions for a n-hub , b-branch associated lumped arrange, we first compose Kirchhoff `s law The nearby connection of these expressions with

Slide 17

And current vector is determined as takes after

Slide 18

Hence, We get cutset conditions

Slide 19

Example

Slide 20

subsequently the key cutset grid yields the cutset conditions

Slide 21

For this situation we require fathom for the voltage capacity to acquire each branch variable.