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

+
+
. cutset
with associated branch tree the as cutset
defining surface closed the to regard h wit
on oriientati opposite the has and cutset in is branch if : 1
. cutset in not is branch if : 0

. set - cut with associated branch
tree the as cutset defining surface closed the to regard
n with orientatio same the has and cutset in is branch if : 1
i
i
i j
i j
i
i
i j
ij
q
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)
a
WA Q =
Loop incidence matrix
Loop incidence matrix defined by

loop. the as direction opposite in the

oriented is and loop in is branch if : 1 -
. loop in not is branch if : 0
loop. the as direction same in the
oriented is and loop in is branch if : 1
i j
i j
i j
b
ij
Loop incidence matrix & KVL

We define branch voltage vector



We may write the KVL loop equations
conveniently in vector matrix form as




)]` ( ),..., ( ), ( [ ) (
2 1
t v t v t v t v
b b

t all for 0 ) ( = t v B
b a
General Case
t) all (for 0 ) ( ) ( ) (
3 2 1
= t v t v t v
t) all (for 0 ) ( ) ( ) (
3 2 1
= + t i t i t i
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

0 ) ( t Qi
b
) ( ` ) ( t v Q t v
t b

0 ) ( t Ai
b
) ( ` ) ( t v A t v
n b



b b b b
t v y t i t + = ) ( ) (
) (
k b
y diag y

source current t independen an contains branch th if : 0

L value of inductance an contains branch th if :
L
1
R value of resistance a contains branch th if :
R
1
C value of e capacitanc a contains branch th if : C
source. voltage indepedent an contains branch th if : 0
k
k
k
k
k k
k
k
D
k
k D
k
y
k

And current vector is specified as
follows

b
t

.
.

function time by the specified source
current t independen an contains branch th if : ) (
) (t condition initial
with the inductance an contains branch th if :
resistance a contains branch th if : 0
e capacitanc a contains branch th if : 0
source t voltage independen an contains branch th if : ) (
0 0
0
k
k
k k
k
k
k
i
k t i
i i
k i
k
k
k t i
t


Hence,



We obtain cutset equations





b t b b
Q t v Q Qy t Qi t + = = ) ( ` ) ( 0
b t b
Q t v Q Qy t = ) ( `
) ( ` ) ( t v Q t v
i
b
.
.

b
i
b
Q t v Q Qy t = .
.
) ( `
Example
(
(
(
(
(
(
(

+
(
(
(
(
(
(
(
(

=
.
0
) (
) (
0
) (
) (
0 0 0 0
0
1
0 0 0
0 0 0 0 0
0 0 0
1
0
0 0 0 0 0
) (
0 4
1
t i
t i
t i
t v
CD
LD
R
t i
b b
hence the fundamental cutset matrix



yields the cutset equations


(

+
+
=
1 - 1 - 1 - 1 0
1 - 1 - 1 - 0 1
Q
(
(

+
+ +
=
(
(

(
(
(

+ + +
+ +
.
.
.
) ( ) (
) ( ) ( ) (
) (
) (
1 1

1
1

1
0 4
0 4 1
2
t i t i
t i t i t i
t v
t v
CD
LD R
CD
LD
CD
LD
CD
LD
In this case we need only solve



for the voltage function to obtain
every branch variable.

} }
+ + = + +
.
.
.
t
t
t
t
t i t i
dt
t v d
C d v
L dt
t dv
C d v
L
t v
R
0 0
) ( ) (
) (
) (
1 ) (
) (
1
) (
1
0 4
2
2 2
t t t t
2
v