180070025-ROHAN JASANI

180070030-LALIT SAINI
180070068-YASH SANJEEV
 SOME TERMS AND THEIR DEFINITIONS-1
• Circuit elements:
• The mathematical models of a two terminal electrical devices
• Completely characterized by its voltage-current relationship
• Can not be subdivided into other two-terminal devices

• Node:
• A point at which two or more circuit elements have a common connection
• The number of branches incident to a node is known as the degree of that node

• Branch:
• A single path, containing one circuit element, which connnects one node to any other node
• Represented by a line in the graph

• Path:
• A set of elements that may be traversed in order without passing through the same node
twice
 SOME TERMS AND THEIR DEFINITIONS-2
• Loop:
• A close path or a closed contour selected in a network/circuit
• A path that may be started from a prticular node to other nodes through branches and comes
to the original/starting node
• Also known as closed path or circuit

• Mesh:
• A loop that does not contain any other loops within it
• Any mesh is a circuit/loop but any loop/circuit may not be a mesh

• Network:
• The interconnection of two or more circuit elements forms an electical network

• Circuit:
• Network that contains at least one closed path
• Every circuit is a network, but not all networks are circuits

• Planar circuit:
• A circuit that may be drawn on a plane surface in such a way that no branch passes over or
under any other branch
 SOME TERMS AND THEIR DEFINITIONS-3
• Topology:
• Deals with properties of networks which are unaffected when the network is stretched,
twisted, or otherwise distorted the size and the shape
• Not concerned with the particular types of elements appearing in the circuit, but only with
the way in which branches and nodes are arranged

• Graph:
• A graph corresponding to a given network is obtained by replacing all circuit elements with
lines

• Connected Graph:
• A graph in which at least one path exists between any two nodes of the graph
• If the network has a transformer as one of the element, then the resulted graph is unconnected

• Oriented Graph:
• A graph in which at least one path exists between any two nodes of the graph
• If the network has a transformer as one of the element, then the resulted graph is unconnected

• Subgraph:
• A graph in which at least one path exists between any two nodes of the graph
• If the network has a transformer as one of the element, then the resulted graph is unconnected
CONVERSION OF CIRCUIT TO CONNECTED GRAPH
Any electric circuit or network can be converted into its equivalent graph by replacing the passive
elements and voltage sources with short circuits and the current sources with open circuits. That means, the
line segments in the graph represent the branches corresponding to either passive elements or voltage
sources of electric circuit.

Circuit

Directed Graph
corresponding to given circuit
 SOME TERMS AND THEIR DEFINITIONS-4
• Tree:
• A connected subgraph having all the nodes of a graph without any loop.
• Thus, a tree is a subgraph that has the following properties:
• It must consist of all nodes of a complete graph
• For a graph having ‘n’ nodes, the tree of given graph will have ‘n-1’ branches
• There exists one and only one path between any pair of nodes
• A tree should not have any closed path
• The rank of a tree is ‘n − 1’. This is also the rank of the graph to which the tree
belongs
• Twigs:
• The branches of a tree are known as twigs
• Links:
• The branches that are removed from the graph while forming a tree are termed as
links or chords
• Links are complement of twigs

• Co-tree:
• The graph constituted with links is known as co-tree
EXAMPLE
 NODE INCIDENCE MATRIX

• An Incidence Matrix represents the graph of a given electric circuit or network. Hence, it is
possible to draw the graph of that same electric circuit or network from the incidence matrix.

• If there are ‘n’ nodes and ‘b’ branches are present in a directed graph, then the incidence
matrix will have ‘n’ rows and ‘b’ columns. Here, rows and columns are corresponding to the
nodes and branches of a directed graph. Hence, the order of incidence matrix will be n × b.

• The elements of incidence matrix will be having one of these three values, +1, -1 and 0.
• If the branch current is leaving from a selected node, then the value of the element will be +1.
• If the branch current is entering towards a selected node, then the value of the element will be -1.
• If the branch current neither enters at a selected node nor leaves from a selected node, then the
value of element will be 0.
EXAMPLE OF INCIDENCE MATRIX

Incidence matrix corresponding to the graph

We observe that sum of all rows is zero that is only n-1 rows
are independent hence we can define reduced incidence
matrix by removing any one row from incidence matrix
 FUNDAMENTAL LOOP MATRIX(B)

• Fundamental loop or f-loop is a loop, which contains only one link and one or more twigs. So, the
number of f-loops will be equal to the number of links.

• If there are ‘n’ nodes and ‘b’ branches present in a directed graph, then the number of links present in a
co-tree, which is corresponding to the selected tree of given graph will be b-n+1.

• The elements of fundamental loop matrix will be having one of these three values, +1, -1
and 0.
• The value of element will be +1 for the link of selected f-loop.
• The value of elements will be 0 for the remaining links and twigs, which are not part of the selected f-loop.
• If the direction of twig current of selected f-loop is same as that of f-loop link current, then the value of
element will be +1.
• If the direction of twig current of selected f-loop is opposite to that of f-loop link current, then the value of
element will be -1.
EXAMPLE OF F-LOOP MATRIX

f-loop matrix corresponding to graph

Define above matrix as FLT matrix

 FUNDAMENTAL CUT-SET MATRIX(Q)

• Fundamental cut set or f-cut set is the minimum number of branches that are removed from a graph in
such a way that the original graph will become two isolated subgraphs.

• The f-cut set contains only one twig and one or more links. So, the number of f-cut sets will be equal to
the number of twigs. If there are ‘n’ nodes and ‘b’ branches present in a directed graph, the order of
fundamental cut set matrix will be (n-1) × b.

• The elements of fundamental cut-set matrix will be having one of these three values, +1, -1
and 0.
• The value of element will be +1 for the twig of selected f-cut set.
• The value of elements will be 0 for the remaining twigs and links, which are not part of the selected f-cutset.
• If the direction of link current of selected f-cut set is same as that of f-cut set twig current, then the value of
element will be +1.
• If the direction of link current of selected f-cut set is opposite to that of f-cut set twig current, then the value of
element will be -1.
EXAMPLE OF F-CUT SET MATRIX

f-cut set matrix corresponding to graph

Define the above matrix as FCL matrix

 RELATION BETWEEN FUNDAMENTAL LOOP MATRIX,
FUNDAMENTAL CUT SET MATRIX & INCIDENCE MATRIX

We observe that BQT=0.

=>[IL FLT][FCL IT]T=0
=>FCL= -(FLT)T
Thus we see from above that we can easily get a fundamental cut set matrix
from fundamental loop matrix and vice versa.
Let incidence matrix be A=[A11 A12]
Then FLT= -(A11)T ((A12)-1)T
Thus we get fundamental loop matrix from incidence matrix.
 EXAMPLE

Incidence matrix corresponding to graph

Fundamental loop matrix Fundamntal Cut set matrix

 EXAMPLE(CONTINUED)

Thus from this example we have verified relationship between fundamental loop
matrix, cut set matrix and incidence matrix given on slide 14
 LINEARLY INDEPENDENT KVL USING F-LOOP MATRIX
• From fundamental loop matrix we get linearly independent Kirchhoff's Voltage Law
(KVL) equations by multiplying voltage matrix with link voltages followed by twig
voltages in order written in fundamental loop matrix.

• [IT FLT][VL VT]T = 0 => VL= -(FLTVT) thus we get b-n+1 independent KVL equations
where b=number of branches and n=nodes in directed graph. We also see that link
voltages can be written by linear combination of twig voltages.

• Also twig voltages are independent of each other hence twig voltages form the bases
of voltage space of circuit.
 LINEARLY INDEPENDENT KCL USING F-CUT SET MATRIX
• From fundamental cut set matrix we get linearly independent Kirchhoff’s Current Law (KCL)
equations by multiplying current matrix with link currents followed by twig currents in order
written in fundamental cutset matric matrix.

• [FCL IT][iL iT]T = 0 =>iT=FCLiL thus we get n-1 independent KCL equations where n=nodes in
directed graph. We also see that twig currents can be written by linear combination of link
currents.

• Also link currents are independent of each other hence link voltages form the bases of
voltage space of circuit

• Thus we get total b-n+1+n-1=b independent equations but there are 2b unknowns(currents
through each branch and voltage difference across each branch)

• Hence we get another ‘b’ equations by elemental relationships of circuit.

 BRANCH VOLTAGE SOURCE VECTOR (E)

• The Branch Voltage Source Vector is a column matrix depicting the effect of
voltage sources on the potential difference across the edges of a graph G.

• For a directed graph G, the ith component of this vector has magnitude equal
to the electromotive force of the voltage source present along the branch
labelled i, but the sign is put in accordance with the direction of the branch.
 IMPEDANCE MATRIX (Z)

• The Impedance Matrix is a square matrix of dimension b × b, where b

denotes the number of edges.

• The element (x,y) denotes the impedance (i.e. the linear relation) between the
voltage difference across edge x (vx) and the current through edge y (iy).

𝜕𝑉𝑥
• Hence 𝜕𝑖𝑦
= Zxy considering currents through edges as independent variables.
 GENERALISED OHM’S LAW IN LAPLACE DOMAIN

• We write Ohm’s Law in Laplace Domain using impedance matrix and voltage
source vector.

• V(s) = E(s) + Z(s)I(s) gives us the Ohm’s Law.

• Ohm’s Law can be used instead of elemental equations to get other ‘b’
linearly independent relations required.
 EXAMPLE

Circuit to be analysed Directed graph of circuit to be analysed

 STEP1:KIRCHHOFF’S CURRENT LAW(KCL)

Q[iL iT]T = [FCL IT][iL iT]T = 0

Graph of circuit to be analysed

Thus we get n-1=4-1=3 independent equations KCL equations

 STEP 2: KIRCHHOFF’S VOLTAGE LAW(KVL)

B[VL VT]T=[IT FLT][VL VT]T = 0

Graph of circuit to be analysed

Thus we get b-n+1=5-4+1=2 independent KVL equations

 STEP 3: OHM’S LAW

V(s) = E(s) + Z(s)I(s)

THANK YOU

Thus we get b=5 independent Ohm’s Law equations

Thus we got 10 linearly independent equations and
there are 10 variables which can be solved to analyse
the circuit