CIRCUIT THEORY

UNIT - 5

CONTENTS

Graph of a network
Incidence matrices
Trees
Cutsets
Tieset
Duality
Dual networks.

GRAPH

A circuit graph is a description of the topology of the circuit,

with details of the circuit elements suppressed.
The graph contains branches and nodes.
A branch is a curve drawn between two nodes to indicate an
electrical connection between the nodes.
A directed graph is one for which a polarity marking is
assigned to all branches
A connected graph is one in which there is a continuous path
through all the branches which touches all the nodes.
A graph said to be sub-graph of a graph G if every node of is
a node of G and every branch of is also a branch of G.

Incidence matrix

Any oriented graph can be described completely in a compact

matrix form.
the orientation of each branch in the graph and the nodes at
which this branch is incident is called incident matrix.
When one row is completely deleted from the matrix the
remaining matrix is called a reduced incidence matrix.

FORMATION OF INCIDENCE MATRIX

Each row of the matrix being representing the corresponding
node of the graph.
Each column corresponds to a branch.
If a graph contain N- nodes and B branches then the size of
the incidence matrix [A] will be N x B.

TREES
It is an interconnected open set of branches which includes all the
nodes of the given graph.
The tree of the graph does not contain any closed loop.
Tree branch (Twig) is the branch of a tree. It is also named as twig.
Tree link (chord) is the branch of a graph that does not belong to the
particular tree.
Loop is the closed contour selected in a graph.

Properties of a Tree
It consists of all the nodes of the graph.
If the graph has N nodes, then the tree has (N-1) branch.
There will be no closed path in a tree.
There can be many possible different trees for a given graph
depending on the no. of nodes and branches.

Cut-Set
It is that set of elements or branches of a graph
that separated two parts of a network.
If any branch of the cut-set is not removed, the
network remains connected.
The term cut-set is derived from the property
designated by the way by which the network can be
divided into two parts.

Fundamental cut-set matrix

A fundamental cut-set of a graph w.r.t a tree is a cut-set formed by
one twig and a set of links.
Thus in a graph for each twig of a chosen tree there would be a
fundamental cut set.
No. of cut-sets = No. of twigs = N-1.
Procedure of obtaining cut-set matrix: Arbitrarily a tree is selected in a graph.
Form the fundamental cut-sets with each twig in the graph for
the entire tree.
Assume directions of the cut-sets oriented in the same direction
of the concerned twig.
Fundamental cut-set matrix [ Qkj]

Qkj =+1; when branch bj has the same orientation of the cut-set
Qkj =-1; when branch bj has the opposite orientation of the cutset
Qkj =0; when branch bj is not in the cut-set

Tie-Set

It is a unique set with respect to a given tree at a connected

graph containing one chord and all of the tree branches
contained in the tree path formed between two vertices of the
chord.
It is also called as Loop Incidence Matrix or Circuit Matrix

Fundamental Tie-set matrix

A fundamental tie-set of a graph w.r.t a tree is a loop formed by only

one link associated
with other twigs.
No. of fundamental loops = No. of links = B-(N-1)
Procedure of obtaining Tie-set matrix: Arbitrarily a tree is selected in the graph.
From fundamental loops with each link in the graph for the
entire tree.
Assume directions of loop currents oriented in the same
direction as that of the link.
From fundamental tie-set matrix [bij] where
bij =1; when branch bj is in the fundamental loop i and their
reference directions are oriented same.
bij =-1; when branch bj is in the fundamental loop i but, their
reference directions are oriented oppositely.
bij =0; when branch bj is not in the fundamental loop i .

DUALITY

Two networks are said to be dual if the mesh equations of a given

network has the same mathematical form as the nodal equations
of the other network.
The property of duality is a mutual property.

Element
Resistance (R)
Inductance (L)
Capacitance (C)
Impedance (Z)
Voltage source
Current source
Open circuit
Mesh analysis

Dual Element
Conductance (G)
Capacitance (C)
Inductance (L)
Admittance (Y)
Current source
Voltage source
Short circuit
Nodal analysis

PROPERTIES OF DUAL NETWORK

The number of meshes in a given network is equal
to the number of nodes in the other network.
The total impedance of the given network is equal
to the total admittance of the dual network.
Voltage source common to both the loops are
represented as current source common to two
nodes.

CONSTRUCTION OF DUAL
NETWORK
Mathematical Method
Apply kirchoffs law to the given network and find
the equilibrium equations.
Replace each element in the network by the
equivalent dual element.
Write the new equilibrium equation using the dual
elements.
Construct the dual network from the equilibrium
equations.

Construction of dual network contd.

Dot Method
A dot is placed in each independent loop of the original
network. These dots placed inside the loops correspond to
independent nodes in the dual network.
A dot is placed outside the given network which will
correspond to the reference node of the dual network.
All the dots are connected by dotted lines crossing all the
branches.
The dotted lines should cross only one branch at a time.
The dual elements will form the branches connecting the
corresponding nodes in the dual network.
The voltage rise in the direction of a clockwise loop current
corresponds to a current flowing towards the independent
node in the dual network.
Clockwise current in a loop corresponds to a positive
polarity at the dual independent node.

THANK YOU