Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Tie-Set(Loop) Matrix
Complete loop matrix or simply circuit matrix is used to describe the way in which
the branches constitute loops or circuits in a graph.
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.
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.
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.
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.
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.
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.
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.
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
.. .. .. .. .. .. ..
. . . . . . .
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
.. .. .. .. .. .. ..
. . . . . . .
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
.. .. .. .. .. .. ..
. . . . . . .
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.
10 k
0.4ix ix
5 mA 25 F 27 k
10 k
0.4ix ix
5 mA 25 F 27 k
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
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
2 10 k
1 3
0.4ix ix
5 mA 25 F 27 k
4
Lets now draw the graph of the given circuit!
4 4
Lets now draw the graph of the given circuit!
a. Identify arbitrary locations for 4 nodes
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
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
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
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
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
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
2
10 k 1 c 3
2 b
1 3
0.4ix ix
d e f
5 mA 25 F 27 k
4 4
4 f 3
4
Graph could have been drawn this way
depending on the location of nodes!
1 d 4
4
Graph could have been drawn this way
depending on the location of nodes!
Or this way!!
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!
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 =
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
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
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
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
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
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
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
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
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.
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.
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.
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.
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.
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.
b 2 c
1 3
d e f
b 2 c
1 3
d e f
b 2 c
1 3
d e f
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
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}
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}
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
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
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}
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
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
b 2 c
1 3
d e f
d e f d e f
4 4
L2 L4
d e f d e f d e f d e f
4 4 4 4
L2 L4
d e f d e f d e f d e f
4 4 4 4
b 2 c
1 3
d e f
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 }
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
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
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
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
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}.
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
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).
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
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 }
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
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
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
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.
b 2 c
1 3
d e 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 }
a
L1
b 2 c
1 3
L2 L3
d e f
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.
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.
Thank You!
Any Question?