EE - 304 Electrical Network Theory

Tie-Set(Loop) Matrix

North-Eastern Hill University

29.08.2016 joIp_rkas, ECE, NEHU, Shillong - 793 022

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Complete loop matrix or simply circuit matrix is used to describe the way in which
the branches constitute loops or circuits in a graph.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 1 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Complete loop matrix or simply circuit matrix is used to describe the way in which
the branches constitute loops or circuits in a graph.
- To write this matrix in a systematic way, an arbitrary orientation is specified for
each loop using an ordered list of its branches and nodes.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 1 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Complete loop matrix or simply circuit matrix is used to describe the way in which
the branches constitute loops or circuits in a graph.
- To write this matrix in a systematic way, an arbitrary orientation is specified for
each loop using an ordered list of its branches and nodes.
- The total number of loops are determined using an exhaustive search.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 1 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Complete loop matrix or simply circuit matrix is used to describe the way in which
the branches constitute loops or circuits in a graph.
- To write this matrix in a systematic way, an arbitrary orientation is specified for
each loop using an ordered list of its branches and nodes.
- The total number of loops are determined using an exhaustive search.

There are two types of loop/circuit matrices:

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 1 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Complete loop matrix or simply circuit matrix is used to describe the way in which
the branches constitute loops or circuits in a graph.
- To write this matrix in a systematic way, an arbitrary orientation is specified for
each loop using an ordered list of its branches and nodes.
- The total number of loops are determined using an exhaustive search.

There are two types of loop/circuit matrices:

- Complete loop/circuit matrix, BC ,

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 1 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Complete loop matrix or simply circuit matrix is used to describe the way in which
the branches constitute loops or circuits in a graph.
- To write this matrix in a systematic way, an arbitrary orientation is specified for
each loop using an ordered list of its branches and nodes.
- The total number of loops are determined using an exhaustive search.

There are two types of loop/circuit matrices:

- Complete loop/circuit matrix, BC ,
- Loop/circuit/tie-set matrix, B.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 1 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Complete loop matrix or simply circuit matrix is used to describe the way in which
the branches constitute loops or circuits in a graph.
- To write this matrix in a systematic way, an arbitrary orientation is specified for
each loop using an ordered list of its branches and nodes.
- The total number of loops are determined using an exhaustive search.

There are two types of loop/circuit matrices:

- Complete loop/circuit matrix, BC ,
- Loop/circuit/tie-set matrix, B.

For a graph having n nodes and b branches, the complete loop matrix Bc , is a
rectangular matrix with b columns and as many rows as there are loops.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 1 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

That is, the complete loop matrix, Bc , of the graph of n nodes and b branches is
Branches
Circuits 1 2 3 4 ... b
L1 b11 b12 b13 b14 ... b1b

L2
b21 b22 b23 b24 ... b2b
Orientation of
L3
b31 b32 b33 b34 ... b3b
loops/circuits in the graph
L4 b41 b42 b43 b44 ... b4b

Bc =


is considered to be arbitrary
L5
b51 b52 b53 b54 ... b5b
while deriving Bc !
L6
b61 b62 b63 b64 ... b6b

.. .. .. .. .. .. ..
. . . . . . .

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 2 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

That is, the complete loop matrix, Bc , of the graph of n nodes and b branches is
Branches
Loops 1 2 3 4 ... b
L1 b11 b12 b13 b14 ... b1b

L2
b21 b22 b23 b24 ... b2b

L3
b31 b32 b33 b34 ... b3b
There will be b number of
L4 b41 b42 b43 b44 ... b4b

Bc =


columns in Bc !
L5
b51 b52 b53 b54 ... b5b

L6
b61 b62 b63 b64 ... b6b

.. .. .. .. .. .. ..
. . . . . . .

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 2 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

That is, the complete loop matrix, Bc , of the graph of n nodes and b branches is
Branches
Loops 1 2 3 4 ... b
L1 b11 b12 b13 b14 ... b1b

L2
b21 b22 b23 b24 ... b2b

L3
b31 b32 b33 b34 ... b3b
Number of rows in Bc
Bc = L4

b41 b42 b43 b44 ... b4b

equals to that of possible
loops in the graph!

L5
b51 b52 b53 b54 ... b5b

L6
b61 b62 b63 b64 ... b6b

.. .. .. .. .. .. ..
. . . . . . .

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 2 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

That is, the complete loop matrix, Bc , of the graph of n nodes and b branches is
Branches
Loops 1 2 3 4 ... b
L1 b11 b12 b13 b14 ... b1b

L2
b21 b22 b23 b24 ... b2b

L3
b31 b32 b33 b34 ... b3b

L4 b41 b42 b43 b44 ... b4b

Bc =



L5
b51 b52 b53 b54 ... b5b

L6
b61 b62 b63 b64 ... b6b

.. .. .. .. .. .. ..
. . . . . . .
The elements of the complete loop/circuit matrix have the following values:


1, if the branch j is in the loop i and their orientations coincide,
bij = 1, if the branch j is in the loop i and their orientations are opposite,

0, if the branch j is not in the loop i.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 2 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H

10 k

0.4ix ix
5 mA 25 F 27 k

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H

10 k

0.4ix ix
5 mA 25 F 27 k

Check whats missing in the given circuit!

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H

2 10 k
1 3
0.4ix ix
5 mA 25 F 27 k

4
Check whats missing in the given circuit!
- Assign node numbers

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H

2 10 k
1 3
0.4ix ix
5 mA 25 F 27 k

4
Check whats missing in the given circuit!
- Assign node numbers
- Assign branch current directions

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H

2 10 k
1 3
0.4ix ix
5 mA 25 F 27 k

4
Lets now draw the graph of the given circuit!

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H
2
10 k 1 3
2
1 3
0.4ix ix
5 mA 25 F 27 k

4 4
Lets now draw the graph of the given circuit!
a. Identify arbitrary locations for 4 nodes

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H a

2
10 k 1 3
2
1 3
0.4ix ix
5 mA 25 F 27 k

4 4
Lets now draw the graph of the given circuit!
a. Identify arbitrary locations for 4 nodes
b. Connect nodes for each branch in order

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H a

2
10 k 1 3
2 b
1 3
0.4ix ix
5 mA 25 F 27 k

4 4
Lets now draw the graph of the given circuit!
a. Identify arbitrary locations for 4 nodes
b. Connect nodes for each branch in order

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H a

2
10 k 1 c 3
2 b
1 3
0.4ix ix
5 mA 25 F 27 k

4 4
Lets now draw the graph of the given circuit!
a. Identify arbitrary locations for 4 nodes
b. Connect nodes for each branch in order

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H a

2
10 k 1 c 3
2 b
1 3
0.4ix ix
d
5 mA 25 F 27 k

4 4
Lets now draw the graph of the given circuit!
a. Identify arbitrary locations for 4 nodes
b. Connect nodes for each branch in order

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H a

2
10 k 1 c 3
2 b
1 3
0.4ix ix
d e
5 mA 25 F 27 k

4 4
Lets now draw the graph of the given circuit!
a. Identify arbitrary locations for 4 nodes
b. Connect nodes for each branch in order

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H a

2
10 k 1 c 3
2 b
1 3
0.4ix ix
d e f
5 mA 25 F 27 k

4 4
Lets now draw the graph of the given circuit!
a. Identify arbitrary locations for 4 nodes
b. Connect nodes for each branch in order

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H a

2
10 k 1 c 3
2 b
1 3
0.4ix ix
d e f
5 mA 25 F 27 k

4 4

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H
a
2 10 k 1 b 2
1 3
0.4ix ix
e
25 F d c
5 mA 27 k

4 f 3
4
Graph could have been drawn this way
depending on the location of nodes!

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H
a
2 10 k 2 3
1 3 c
0.4ix ix
5 mA 25 F 27 k b e f

1 d 4
4
Graph could have been drawn this way
depending on the location of nodes!
Or this way!!

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the following network and lets find its Bc !

2H

2 10 k a
1 3
2 c 3 f
0.4ix ix 1 b 4
e
5 mA 25 F 27 k
d

4
Or this way!

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 3 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Now, lets find all possible loops on this graph below to get Bc .
a

2 Branches
1 c 3 Loops a b c d e f
b





d e f
Bc =

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 c Branches
1 3 Loops a b c d e f
b





d e f
Bc =

b branches b columns
In Bc , there will be:
all loops as many rows as loops the graph has

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 c Branches
1 3
b
Loops a b c d e f
Loop 1: L1 {a,c,b} L1 1 -1 -1 0 0 0





d e f
Bc =

b branches b columns
In Bc , there will be:
all loops as many rows as loops the graph has

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 c Branches
1 3 Loops a b c d e f
b

Loop 2: L2 {b,e,d} L2 0 1 0 1 1 0


L2




d e f
Bc =

b branches b columns
In Bc , there will be:
all loops as many rows as loops the graph has

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 c Branches
1 3 Loops a b c d e f
b


L3 1 -1 0 0 -1 1

Loop 3: L3 {a,f,e,b}

d e f
Bc =

b branches b columns
In Bc , there will be:
all loops as many rows as loops the graph has

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 c Branches
1 3 Loops a b c d e f
b

L4






d e Loop 4: L4 {a,c,e,d} L4 1 0 -1 1 1 0
Bc =

b branches b columns
In Bc , there will be:
all loops as many rows as loops the graph has

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 c Branches
1 3 Loops a b c d e f
b


L5




d e f
Bc =
Loop 5: L5 {c,f,e} L5
0 0 1 0 -1 1

b branches b columns
In Bc , there will be:
all loops as many rows as loops the graph has

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 c Branches
1 3 Loops a b c d e f
b



L6



d e f
Bc =




Loop 6: L6 {a,f,d} L6 1 0 0 1 0 1

b branches b columns
In Bc , there will be:
all loops as many rows as loops the graph has

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 c Branches
1 3 Loops a b c d e f
b





d e L7 f
Bc =






Loop 7: L7 {b,c,f,d} L7 0 1 1 1 0 1

b branches b columns
In Bc , there will be:
all loops as many rows as loops the graph has

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each loop, the complete loop matrix, Bc , is
a

2 Branches
1 3 Loops a b c d e f
b c
Loop 1: L1 {a,c,b} L1 1 -1 -1 0 0 0
L4 Loop 2: L2 {b,e,d} L2

0 1 0 1 1 0


L2 LL5 Loop 3: L3 {a,f,e,b} L3

1 -1 0 0 -1 1

6



d e L7 f Loop 4: L4 {a,c,e,d} L4 1 0 -1 1 1 0
Bc =
Loop 5: L5 {c,f,e} L5
0 0 1 0 -1 1

Loop 6: L6 {a,f,d} L6 1 0 0 1 0 1


Loop 7: L7 {b,c,f,d} L7 0 1 1 1 0 1

There are only 7 possible loops that can be drawn on the given graph!
Thus, Bc has only 7 rows.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 4 / 14

 Tie-Set (Loop/Circuit) Matrix
Complete Loop/Circuit Matrix, Bc

Consider the clock-wise orientation for each circuit, the complete circuit matrix, Bc , is
a

2 Branches
1 3 Circuits a b c d e f
b c
Circuit 1: L1 {a,c,b} L1 1 -1 -1 0 0 0
L4 Circuit 2: L2 {b,e,d} L2

0 1 0 1 1 0


L2 LL5 Circuit 3: L3 {a,f,e,b} L3

1 -1 0 0 -1 1

6



d e L7 f Circuit 4: L4 {a,c,e,d} L4 1 0 -1 1 1 0
Bc =
Circuit 5: L5 {c,f,e} L5
0 0 1 0 -1 1

Circuit 6: L6 {a,f,d} L6 1 0 0 1 0 1


Circuit 7: L7 {b,c,f,d} L7 0 1 1 1 0 1

There are only 7 possible circuits (closed paths) that can be drawn on the given graph!
Thus, Bc has only 7 rows.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 5 / 14

 Tie-Set (Loop/Circuit) Matrix, B

In a graph with n nodes and b branches, we know that there are t = n 1 twigs in a
tree and l = b t = b n + 1 links in the co-tree.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 6 / 14

 Tie-Set (Loop/Circuit) Matrix, B

In a graph with n nodes and b branches, we know that there are t = n 1 twigs in a
tree and l = b t = b n + 1 links in the co-tree.

Consider a tree of a graph:

- Re-placement of each link one at a time in the tree forms a closed path or loop or
circuit. Thus, every link forms a unique loop, closed path or circuit called the
fundamental loop (f-loop) or fundamental circuit (f-circuit) or tie-set, in short.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 6 / 14

 Tie-Set (Loop/Circuit) Matrix, B

In a graph with n nodes and b branches, we know that there are t = n 1 twigs in a
tree and l = b t = b n + 1 links in the co-tree.

Consider a tree of a graph:

- Re-placement of each link one at a time in the tree forms a closed path or loop or
circuit. Thus, every link forms a unique loop, closed path or circuit called the
fundamental loop (f-loop) or fundamental circuit (f-circuit) or tie-set, in short.
- The number of f-circuits is same as that of links in a given tree. Hence, the
number of f -circuits or tie-sets is equal to l = b n + 1.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 6 / 14

 Tie-Set (Loop/Circuit) Matrix, B

In a graph with n nodes and b branches, we know that there are t = n 1 twigs in a
tree and l = b t = b n + 1 links in the co-tree.

Consider a tree of a graph:

- Re-placement of each link one at a time in the tree forms a closed path or loop or
circuit. Thus, every link forms a unique loop, closed path or circuit called the
fundamental loop (f-loop) or fundamental circuit (f-circuit) or tie-set, in short.
- The number of f-circuits is same as that of links in a given tree. Hence, the
number of f -circuits or tie-sets is equal to l = b n + 1.
- The reference direction of the f -loop is taken as that of the link.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 6 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example: In the graph shown below, we select a tree:

a

b 2 c
1 3

d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 7 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example: In the graph shown below, we select a tree: twigs{a, b, e}.

a

b 2 c
1 3

d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 7 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example: In the graph shown below, we select a tree: twigs{a, b, e}.

a In the given diagram on the left,we have
Number of nodes : n=4
b 2 c
1 3 Number of branches : b=6
Number of branches on tree : t =n1=3
Number of links : l =bt
d e f = b (n 1)
=bn+1=3
Therefore, number of f -circuits : 3
f -loops/f -circuits/tie-sets are formed by re-placing each
:::::::::::::
4
link one at a time in the
:::::::::::::::::::::::::::
tree!

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 7 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example: In the graph shown below, we select a tree: twigs{a, b, e}.

a In the given diagram on the left,we have
L1 Number of nodes : n=4
2
1
c
3 Number of branches : b=6
b
Number of branches on tree : t =n1=3
Number of links : l =bt
d e f = b (n 1)
=bn+1=3
Therefore, number of f -circuits : 3
Possible tie-sets or f -loops or f -circuits are now given by
4
f -circuits : L1 {a,b,c}
: L2 {b,d,e}
: L3 {a,b,e,f}

Note: Orientation of f -loop/f -circuit/tie-set is that of the link.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 7 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example: In the graph shown below, we select a tree: twigs{a, b, e}.

a In the given diagram on the left,we have
Number of nodes : n=4
b 2 c
1 3 Number of branches : b=6
Number of branches on tree : t =n1=3
L2
Number of links : l =bt
d e f = b (n 1)
=bn+1=3
Therefore, number of f -circuits : 3
Possible tie-sets or f -loops or f -circuits are now given by
4
f -loops : L1 {a,b,c}
: L2 {b,d,e}
: L3 {a,b,e,f}

Note: Orientation of f -loop/f -circuit/tie-set is that of the link.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 7 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example: In the graph shown below, we select a tree: twigs{a, b, e}.

a In the given diagram on the left,we have
Number of nodes : n=4
2 c
1 3 Number of branches : b=6
b
L3 Number of branches on tree : t =n1=3
Number of links : l =bt
d e f = b (n 1)
=bn+1=3
Therefore, number of f -circuits : 3
Possible tie-sets or f -loops or f -circuits are now given by
4
tie-sets : L1 {a,b,c}
: L2 {b,d,e}
: L3 {a,b,e,f}

Note: Orientation of f -loop/f -circuit/tie-set is that of the link.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 7 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example: In the graph shown below, we select a tree: twigs{a, b, e}.

a In the given diagram on the left,we have
Number of nodes : n=4
b 2 c
1 3 Number of branches : b=6
Number of branches on tree : t =n1=3
Number of links : l =bt
d e f = b (n 1)
=bn+1=3
Therefore, number of f -circuits : 3
Possible tie-sets or f -loops or f -circuits are now given by
4
tie-sets : L1 {a,b,c}
: L2 {b,d,e}
: L3 {a,b,e,f}

Note: Every link defines a fundamental loop/circuit/tie-set of the graph.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 7 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree:

b 2 c
1 3

d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree: twigs{a, b, e}. Thus, the
co-tree: links{c, d, f }.

b 2 c
1 3

d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree: twigs{a, b, e}. Thus, the
co-tree: links{c, d, f }. We now derive Tie-Set Matrix, B, by placing back each link
one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,b,c}
b 2 c : L2 {b,e,d}
1 3
: L3 {a,f,e,b}

d e f Tie-Set or f -Loop or f -Circuit matrix is :

Branches
f -Loops a b c d e f
4
L1
B= L2


L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree: twigs{a, b, e}. Thus, the
co-tree: links{c, d, f }. We now derive Tie-Set Matrix, B, by placing back each link
one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
L1 f -loops : L1 {a,b,c}
2 : L2 {b,e,d}
1 3
b c : L3 {a,f,e,b}

d e f Tie-Set or f -Loop or f -Circuit matrix is :

Branches
f -Loops a b c d e f
4
L1 -1 1 1 0 0 0
B= L2


L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree: twigs{a, b, e}. Thus, the
co-tree: links{c, d, f }. We now derive Tie-Set Matrix, B, by placing back each link
one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,b,c}
b 2 c : L2 {b,e,d}
1 3
: L3 {a,f,e,b}

L2
d e f Tie-Set or f -Loop or f -Circuit matrix is :
Branches
f -Loops a b c d e f
4
L1 -1 1 1 0 0 0
B= L2 0 1 0 1 1 0

L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree: twigs{a, b, e}. Thus, the
co-tree: links{c, d, f }. We now derive Tie-Set Matrix, B, by placing back each link
one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,b,c}
2 c : L2 {b,e,d}
1 3
b : L3 {a,f,e,b}
L3

d e f Tie-Set or f -Loop or f -Circuit matrix is :

Branches
f -Loops a b c d e f
4
L1 -1 1 1 0 0 0
B= L2 0 1 0 1 1 0

L3 1 -1 0 0 -1 1

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree: twigs{a, b, e}. Thus, the
co-tree: links{c, d, f }. We now derive Tie-Set Matrix, B, by placing back each link
one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,b,c}
b 2 c : L2 {b,e,d}
1 3
: L3 {a,f,e,b}

d e f Tie-Set or f -Loop or f -Circuit matrix is :

Branches
f -Loops a b c d e f
4
L1 -1 1 1 0 0 0
B= L2 0 1 0 1 1 0

L3 1 -1 0 0 -1 1

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree: twigs{a, b, e}. Thus, the
co-tree: links{c, d, f }. We now derive Tie-Set Matrix, B, by placing back each link
one at a time on the tree.
a a a a
L1
b 2 c b 2 c b 2 c 2 c
1 3 1 3 1 3 1 3
b c b
L3
L2
d e f d e f d e f d e f

4 4 4 4

Tree : twigs{a, b, e} L1 {a, b, c} L2 {b, e, d} L3 {a, f , e, b}

Tie-Sets or f -Loops or f -Circuits are : Tie-Set or f -Loop or f -Circuit matrix is :
Branches
f -circuits : L1 {a,b,c}
f -Circuits a b c d e f
: L2 {b,e,d} L1 -1 1 1 0 0 0
: L3 {a,f,e,b} B= L2 0

1 0 1 1 0

L3 1 -1 0 0 -1 1

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Lets obtain the matrix!

Example - 1: In the graph shown below, we select a tree: twigs{a, b, e}. Thus, the
co-tree: links{c, d, f }. We now derive Tie-Set Matrix, B, by placing back each link
one at a time on the tree.
a a a a
L1
b 2 c b 2 c b 2 c 2 c
1 3 1 3 1 3 1 3
b c b
L3
L2
d e f d e f d e f d e f

4 4 4 4

Tree : twigs{a, b, e} L1 {a, b, c} L2 {b, e, d} L3 {a, f , e, b}

Tie-Sets or f -Loops or f -Circuits are : Tie-Set or f -Loop or f -Circuit matrix is :
Branches
tie-sets : L1 {a,b,c}
Tie-Sets a b c d e f
: L2 {b,e,d} L1 -1 1 1 0 0 0
: L3 {a,f,e,b} B= L2 0

1 0 1 1 0

L3 1 -1 0 0 -1 1

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 8 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example - 2: We select a tree:

b 2 c
1 3

d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 9 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example - 2: We select a tree: twigs{a, b, d}. Thus, the co-tree: links{c, e, f }.

a In the given diagram on the left,we have

b 2 c
Number of nodes : n=4
1 3
Number of branches : b=6
Number of branches on tree : t =n1=3
d e f Number of links : l =bt
= b (n 1)
4
=bn+1=3
Tree : twigs{a, b, d} Therefore, number of f -circuits : 3
Tie-Sets or f -Loops or f -Circuits are : Tie-Set or f -Loop or f -Circuit matrix is :
Branches
tie-sets : L1 {a,b,c}
Tie-Sets a b c d e f
: L2 {b,e,d}
L1
: L3 {a,f,d} B= L2




L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 9 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example - 2: We select a tree: twigs{a, b, d}. Thus, the co-tree: links{c, e, f }. We

now derive Tie-Set Matrix, B, by placing back each link one at a time on the tree.
a a
L1
b 2 c 2
1 3 1 3
b c

d e f d e f

4 4

Tree : twigs{a, b, d} L1 {a, b, c}

Tie-Sets or f -Loops or f -Circuits are : Tie-Set or f -Loop or f -Circuit matrix is :
Branches
tie-sets : L1 {a,b,c}
: L2 {b,e,d}
Tie-Sets a b c d e f
L1 -1 1 1 0 0 0
: L3 {a,f,d} B= L2




L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 9 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example - 2: We select a tree: twigs{a, b, d}. Thus, the co-tree: links{c, e, f }. We

now derive Tie-Set Matrix, B, by placing back each link one at a time on the tree.
a a a
L1
b 2 c 2 b 2 c
1 3 1 3 1 3
b c Orientation of
L2
loop/circuit
d e f d e f d e f changes with
that of the link!
4 4 4

Tree : twigs{a, b, d} L1 {a, b, c} L2 {b, e, d}

Tie-Sets or f -Loops or f -Circuits are : Tie-Set or f -Loop or f -Circuit matrix is :
Branches
tie-sets : L1 {a,b,c}
: L2 {b,e,d}
Tie-Sets a b c d e f
L1 -1 1 1 0 0 0
: L3 {a,f,d} B= L2 0

1 0 1 1 0

L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 9 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example - 2: We select a tree: twigs{a, b, d}. Thus, the co-tree: links{c, e, f }. We

now derive Tie-Set Matrix, B, by placing back each link one at a time on the tree.
a a a a
L1
b 2 c 2 b 2 c 2 c
1 3 1 3 1 3 1 3
b c b

L2 L4
d e f d e f d e f d e f

4 4 4 4

Tree : twigs{a, b, d} L1 {a, b, c} L2 {b, e, d} L3 {a, f , d}

Tie-Sets or f -Loops or f -Circuits are : Tie-Set or f -Loop or f -Circuit matrix is :
Branches
tie-sets : L1 {a,b,c}
: L2 {b,e,d}
Tie-Sets a b c d e f
L1 -1 1 1 0 0 0
: L3 {a,f,d} B= L2 0

1 0 1 1 0

L3 1 0 0 1 0 1

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 9 / 14

 Tie-Set (Loop/Circuit) Matrix, B

Example - 2: We select a tree: twigs{a, b, d}. Thus, the co-tree: links{c, e, f }. We

now derive Tie-Set Matrix, B, by placing back each link one at a time on the tree.
a a a a
L1
b 2 c 2 b 2 c 2 c
1 3 1 3 1 3 1 3
b c b

L2 L4
d e f d e f d e f d e f

4 4 4 4

Tree : twigs{a, b, d} L1 {a, b, c} L2 {b, e, d} L3 {a, f , d}

Tie-Sets or f -Loops or f -Circuits are : Tie-Set or f -Loop or f -Circuit matrix is :
Branches
tie-sets : L1 {a,b,c}
: L2 {b,e,d}
Tie-Sets a b c d e f
L1 -1 1 1 0 0 0
: L3 {a,f,d} B= L2 0

1 0 1 1 0

L3 1 0 0 1 0 1

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 9 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree:

b 2 c
1 3

d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree: twigs{b, c, e}.
Thus, the co-tree: links{a, d, f }.

a a a

b 2 c b 2 c
b 2 c 1 3 1 3
1 3

d e f d e f
d e f

4 4
4
Tree: twigs{b, c, e} Co-tree: links{a, d, f }

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree: twigs{b, c, e}.
Thus, the co-tree: links{a, d, f }. We now derive Tie-Set Matrix, B, by placing back
each link one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,c,b}
b 2 c : L2 {b,e,d}
1 3 : L3 {c,f,e}
Tie-Set or f -Loop or f -Circuit matrix is :

d e f Branches
f -Loops a b c d e f
L1
B= L2


4 L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree: twigs{b, c, e}.
Thus, the co-tree: links{a, d, f }. We now derive Tie-Set Matrix, B, by placing back
each link one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,c,b}
L1
2 : L2 {b,e,d}
1 3 : L3 {c,f,e}
b c
Tie-Set or f -Loop or f -Circuit matrix is :

d e f Branches
f -Loops a b c d e f
L1 1 -1 -1 0 0 0
B= L2


4 L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree: twigs{b, c, e}.
Thus, the co-tree: links{a, d, f }. We now derive Tie-Set Matrix, B, by placing back
each link one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,c,b}
b 2 c : L2 {b,e,d}
1 3 : L3 {c,f,e}
Tie-Set or f -Loop or f -Circuit matrix is :
L2
d e f Branches
f -Loops a b c d e f
L1 1 -1 -1 0 0 0
B= L2 0 1 0 1 1 0

4 L3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree: twigs{b, c, e}.
Thus, the co-tree: links{a, d, f }. We now derive Tie-Set Matrix, B, by placing back
each link one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,c,b}
b 2 c : L2 {b,e,d}
1 3 : L3 {c,f,e}
Tie-Set or f -Loop or f -Circuit matrix is :
L3
d e f Branches
f -Loops a b c d e f
L1 1 -1 -1 0 0 0
B= L2 0 1 0 1 1 0

4 L3 0 0 1 0 -1 1

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree: twigs{b, c, e}.
Thus, the co-tree: links{a, d, f }. We now derive Tie-Set Matrix, B, by placing back
each link one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,c,b}
b 2 c : L2 {b,e,d}
1 3 : L3 {c,f,e}
Tie-Set or f -Loop or f -Circuit matrix is :

d e f Branches
f -Loops a b c d e f
L1 1 -1 -1 0 0 0
B= L2 0 1 0 1 1 0

4 L3 0 0 1 0 -1 1

We now re-arrange columns in B with links first and twigs later as {a, d, f , b, c, e}.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree: twigs{b, c, e}.
Thus, the co-tree: links{a, d, f }. We now derive Tie-Set Matrix, B, by placing back
each link one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,c,b}
L1
b 2 c : L2 {b,e,d}
1 3 : L3 {c,f,e}
Tie-Set or f -Loop or f -Circuit matrix is :
L2 L3
e Branches
d f
links twigs
f -Loops a d f b c e
L1 1 0 0 -1 -1 0
4 B= L2 0 1 0 1 0 1

L3 0 0 1 0 1 -1

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set (Loop/Circuit) Matrix, B
Rank of the tie-set matrix!

Example - 3: In the graph shown below on the left, we select a tree: twigs{b, c, e}.
Thus, the co-tree: links{a, d, f }. We now derive Tie-Set Matrix, B, by placing back
each link one at a time on the tree.
Tie-Sets or f -Loops or f -Circuits are :
a
f -loops : L1 {a,c,b}
L1
b 2 c : L2 {b,e,d}
1 3 : L3 {c,f,e}
Tie-Set or f -Loop or f -Circuit matrix is :
L2 L3
e Branches
d f
links twigs
f -Loops a d f b c e
L1 1 0 0 -1 -1 0
4 B= L2 0 1 0 1 0 1

L3 0 0 1 0 1 -1
Thus, B = [Bl , Bt ] = [I, Bt ]. And B is non-singular matrix which rank is (b n + 1).

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 10 / 14

 Tie-Set Matrix, B, and KVL

Kirchhoffs Voltage Law (KVL) of a graph can be applied to the f -loops to obtain a
set of linearly independent equations.

b 2 c
1 3

d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 11 / 14

 Tie-Set Matrix, B, and KVL

Kirchhoffs Voltage Law (KVL) of a graph can be applied to the f -loops to obtain a
set of linearly independent equations. For this, we first select a tree as shown below.

a a a

b 2 c b 2 c b 2 c
1 3 1 3 1 3

d e f d e f
d e f

4 4
4 Tree: twigs{b, c, e} Co-tree: links{a, d, f }

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 11 / 14

 Tie-Set Matrix, B, and KVL

Kirchhoffs Voltage Law (KVL) of a graph can be applied to the f -loops to obtain a
set of linearly independent equations. For this, we first select a tree as shown below.
If Va , Vb , Vc , Vd , Ve and Vf are the branch voltages of branches a, b, c, d, e and
f of the given graph, the KVL equation for each tie-set can be written as
a
L1
b 2 c
1 3

L2 L3
d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 11 / 14

 Tie-Set Matrix, B, and KVL

Kirchhoffs Voltage Law (KVL) of a graph can be applied to the f -loops to obtain a
set of linearly independent equations. For this, we first select a tree as shown below.
If Va , Vb , Vc , Vd , Ve and Vf are the branch voltages of branches a, b, c, d, e and
f of the given graph, the KVL equation for each tie-set can be written as
a Tie-set 1 : Va Vc Vb =0
L1 Tie-set 2 : Vb + Ve + Vd =0
b 2 c Tie-set 3 : Vc + Vf Ve =0
1 3

L2 L3
d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 11 / 14

 Tie-Set Matrix, B, and KVL

Kirchhoffs Voltage Law (KVL) of a graph can be applied to the f -loops to obtain a
set of linearly independent equations. For this, we first select a tree as shown below.
If Va , Vb , Vc , Vd , Ve and Vf are the branch voltages of branches a, b, c, d, e and
f of the given graph, the KVL equation for each tie-set can be written as
a Tie-set 1 : Va Vc Vb =0
L1 Tie-set 2 : Vb + Ve + Vd =0
b 2 c Tie-set 3 : Vc + Vf Ve =0
1 3
Expressing the above equations in matrix form as

Va

L2 L3 1 -1 -1 0 0 0
d e f

0 1 0 1 1 0

Vb = 0

0 0 1 0 -1 1

Vc

Vd



Ve
Vf
4

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 11 / 14

 Tie-Set Matrix, B, and KVL

Kirchhoffs Voltage Law (KVL) of a graph can be applied to the f -loops to obtain a
set of linearly independent equations. For this, we first select a tree as shown below.
If Va , Vb , Vc , Vd , Ve and Vf are the branch voltages of branches a, b, c, d, e and
f of the given graph, the KVL equation for each tie-set can be written as
a Tie-set 1 : Va Vc Vb =0
L1 Tie-set 2 : Vb + Ve + Vd =0
b 2 c Tie-set 3 : Vc + Vf Ve =0
1 3
Expressing the above equations in matrix form as

Va

L2 L3 1 -1 -1 0 0 0
d e f

0 1 0 1 1 0

Vb = 0

0 0 1 0 -1 1

Vc

Vd



Ve
Vf
4
Thus, BVB = 0 where VB is a column vector of branch voltages.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 11 / 14

 Tie-Set Matrix, B, and Branch Currents

Branch currents can be expressed as a linear combination of link currents/loop cur-

rents using B matrix as IB = B0 IL where IB represents branch current matrix and IL
the loop current matrix.

b 2 c
1 3

d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 12 / 14

 Tie-Set Matrix, B, and Branch Currents

Branch currents can be expressed as a linear combination of link currents/loop cur-

rents using B matrix as IB = B0 IL where IB represents branch current matrix and IL
the loop current matrix.

a a a

b 2 c b 2 c b 2 c
1 3 1 3 1 3

d e f d e f
d e f

4 4
4 Tree: twigs{b, c, e} Co-tree: links{a, d, f }

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 12 / 14

 Tie-Set Matrix, B, and Branch Currents

Branch currents can be expressed as a linear combination of link currents/loop cur-

rents using B matrix as IB = B0 IL where IB represents branch current matrix and IL
the loop current matrix.

a
L1
b 2 c
1 3

L2 L3
d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 12 / 14

 Tie-Set Matrix, B, and Branch Currents

Branch currents can be expressed as a linear combination of link currents/loop cur-

rents using B matrix as IB = B0 IL where IB represents branch current matrix and IL
the loop current matrix. i.e.
i

1 0 0

a
ib 1 1 0
a

1
IL1
ic 0 1
= IL2

L1
id 0 1 0
b c

2 IL3
1 3 ie 0 1 1
if 0 0 1
L2 L3
d e f

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 12 / 14

 Tie-Set Matrix, B, and Branch Currents

Branch currents can be expressed as a linear combination of link currents/loop cur-

rents using B matrix as IB = B0 IL where IB represents branch current matrix and IL
the loop current matrix. i.e.
i

1 0 0

a
ib 1 1 0
a

1
IL1
ic 0 1
= IL2

L1
id 0 1 0
b c

2 IL3
1 3 ie 0 1 1
if 0 0 1
L2 L3 Writing branch currents in terms of loop/link currents,
d e f ia = IL1
ib = IL1 + IL2
ic = IL1 + IL3
id = IL2
4 ie = IL2 IL3
if = IL3

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 12 / 14

 Text Books & References

M. E. Van Valkenburg
Network Analysis, 3/e.
PHI, 2005.
W.H. Hayt, J.E. Kemmerly, S.M. Durbin
Engineering Circuit Analysis, 8/e.
MH, 2012.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 13 / 14

 Text Books & References

M. E. Van Valkenburg
Network Analysis, 3/e.
PHI, 2005.
W.H. Hayt, J.E. Kemmerly, S.M. Durbin
Engineering Circuit Analysis, 8/e.
MH, 2012.

D. Roy Choudhury,
Networks and Systems,
New Age Publishers, 1998.
M. Nahvi, J.A. Edminister
Schuams Outline Electric Circuits, 4/e.
TMH, SIE, 2007.
A. Sudhakar, S.S. Palli
Circuits and Networks: Analysis and Synthesis, 2/e.
TMH, 2002.

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 13 / 14

 Khublei Shibun!

Thank You!
Any Question?

AeL. je. siHh/L. J. Singh(nehu/NEHU) EE - 304 Electrical Network Theory 29.08.2016 14 / 14