Scribd
Upload
284 views21 pages

Network Topology Cutset Loop

This document defines key concepts related to network topology analysis including: 1) Connected and disconnected graphs, subgraphs, cut-sets, trees, and loops. 2) Theorems regarding trees and the relationship between nodes, branches, and loops. 3) Fundamental cut-sets and their relationship to trees. Cut-set and loop equations are defined using incidence and fundamental cut-set matrices. 4) The relationship between branch currents and voltages is defined using branch admittance and independent current sources. Cut-set equations are derived relating branch voltages to independent sources.

Uploaded by

karuneee7003
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
284 views21 pages

Network Topology Cutset Loop

This document defines key concepts related to network topology analysis including: 1) Connected and disconnected graphs, subgraphs, cut-sets, trees, and loops. 2) Theorems regarding trees and the relationship between nodes, branches, and loops. 3) Fundamental cut-sets and their relationship to trees. Cut-set and loop equations are defined using incidence and fundamental cut-set matrices. 4) The relationship between branch currents and voltages is defined using branch admittance and independent current sources. Cut-set equations are derived relating branch voltages to independent sources.

Uploaded by

karuneee7003
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 21

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.

Sub Graph : A sub graph is a subset of


the original set of graph branches along
with their corresponding nodes.
(A) Connected Graph (B) Disconnected Graph
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.
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.
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.
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.
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.
Fundamental cutset matrix
 1: if branch j is in cutset i and has the same orientatio n with
 regard to the closed surface defining cutset i as the tree

 branch associated with cut - set i.


 0 : if branch j is not in cutset i.
qij  

  1: if branch j is in cutset i and has the opposite oriientati on

 wit h regard to the closed surface defining
 cutset i as the tree branch associated with

 cutset i.
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

Q  WAa
(A is nodal incidence matrix)
Loop incidence matrix
Loop incidence matrix defined by
 1: if branch j is in loop i and is oriented
 in the same direction as the loop.



bij   0 : if branch j is not in loop i.


 - 1: if branch j is in loop i and is oriented
 in the opposite direction as the loop.

Loop incidence matrix & KVL

We define branch voltage vector


vb (t )  [v1 (t ), v2 (t ),..., vb (t )]`
We may write the KVL loop equations
conveniently in vector – matrix form as

Ba vb (t )  0 for all t
General Case

v1 (t )  v2 (t )  v3 (t )  0 (for all t)
i1 (t )  i2 (t )  i3 (t )  0 (for all t)
To obtain the cut set equations for an n-
node , b-branch connected lumped
network, we first write Kirchhoff `s law

Qib (t )  0 vb (t )  Q`vt (t )
The close relation of these expressions
with
Aib (t )  0 vb (t )  A`vn (t )
ib (t )  yb vb (t )   b
yb  diag ( yk )


0 : if kth branch contains an indepedent voltage source.

C k D : if kth branch contains a capacitance of value C k
1
yk   : if kth branch contains a resistance of value R k
R k
 1
 : if kth branch contains an inductance of value L k
Lk D

0 : if kth branch contains an independent current source
And current vector  bis specified as
follows
ik (t ) : if kth branch contains an independent voltage source
0 : if kth branch contains a capacitance

0 : if kth branch contains a resistance
i : if kth branch contains an inductance with the
 k 0
 k   initial condition ik (t 0 )  ik 0

 i k (t ) : if kth branch contains an independent current
 
 source specified by the time function i k


0  Qib (t )  QybQ`vt (t )  Q b
Hence,
QybQ`vt (t )  Q b

vb (t )  Q`vi (t )

We obtain cutset equations



Qyb Q`vi (t )  Q b

Example

0 0 0 0 0 
  i1 (t ) 
1  0 
0 0 0 0 
 R   
 

ib (t )  0 0 0 0 0  vb (t )   i (t ) 
 
0 1  i4 (t0 )
0 0 0  
 LD  0
0  
 0 0 0 CD 
hence the fundamental cutset matrix
 1 0 - 1 - 1 - 1
Q 
 0  1 - 1 - 1 - 1

yields the cutset equations


 1  CD 1
 CD      
 LD  i (t )  i (t )  i (t ) 
LD v ( t )  1 4 0 
   
 1  CD 1 1   v ( t )    
  CD  2   i (t )  i4 (t0 ) 
 LD R LD 
In this case we need only solve

1 1 t dv2 (t ) 1 t d v(t ) 
v2 (t )  t v2 ( )d  C   t v( )d  C  i (t )  i4 (t0 )
R L 0

dt L 0

dt

for the voltage function v2to obtain


every branch variable.

You might also like