UNIT-II

NETWORK TOPOLOGY

1. Graph:
Network graph is simply called as graph. It consists of a set of
nodes connected by branches. In graphs, a node is a common point
of two or more branches. Sometimes, only a single branch may
connect to the node. A branch is a line segment that connects two
nodes.
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.
Example

2. Types of Graphs
Following are the types of graphs:

 Connected Graph
  Unconnected Graph
 Directed Graph
 Undirected Graph
 Connected Graph:
If there exists at least one branch between any of the two nodes of
a graph, then it is called as a connected graph. That means each
node in the connected graph will be having one or more branches
that are connected to it. So, no node will present as isolated or
separated.
The graph shown in the previous Example is a connected graph.
Here, all the nodes are connected by three branches.
 Unconnected Graph:
If there exists at least one node in the graph that remains
unconnected by even single branch, then it is called as
an unconnected graph. So, there will be one or more isolated
nodes in an unconnected graph.
Consider the graph shown in the following figure.

In this graph, the nodes 2, 3, and 4 are connected by two branches

each. But, not even a single branch has been connected to
the node 1. So, the node 1 becomes an isolated node. Hence, the
above graph is an unconnected graph.
 Directed Graph:
If all the branches of a graph are represented with arrows, then
that graph is called as a directed graph. These arrows indicate the
direction of current flow in each branch. Hence, this graph is also
called as oriented graph.
Consider the graph shown in the following figure.

In the above graph, the direction of current flow is represented with

an arrow in each branch. Hence, it is a directed graph.
 Undirected Graph:
If the branches of a graph are not represented with arrows, then
that graph is called as an undirected graph. Since, there are no
directions of current flow, this graph is also called as an un-
oriented graph.
The graph that was shown in the first Example of this chapter is
an un-oriented graph, because there are no arrows on the
branches of that graph.
3. Subgraph and its Types:
A part of the graph is called as a subgraph. We get subgraphs by
removing some nodes and/or branches of a given graph. So, the
number of branches and/or nodes of a subgraph will be less than
that of the original graph. Hence, we can conclude that a subgraph
is a subset of a graph.
Following are the two types of subgraphs.

 Tree
 Co-Tree
 Tree:
Tree is a connected subgraph of a given graph, which contains all
the nodes of a graph. But, there should not be any loop in that
subgraph. The branches of a tree are called as twigs.
Consider the following connected subgraph of the graph, which is
shown in the Example of the beginning of this chapter.

This connected subgraph contains all the four nodes of the given
graph and there is no loop. Hence, it is a Tree.
This Tree has only three branches out of six branches of given
graph. If we consider even single branch except tree there will be a
loop in the above connected subgraph. Then, the resultant
connected subgraph will not be a Tree.
From the above Tree, we can conclude that the number of
branches that are present in a Tree should be equal to n - 1 where
‘n’ is the number of nodes of the given graph.
  Co-Tree:
Co-Tree is a subgraph, which is formed with the branches that are
removed while forming a Tree. Hence, it is called
as Complement of a Tree. For every Tree, there will be a
corresponding Co-Tree and its branches are called as links or
chords. In general, the links are represented with dotted lines.
The Co-Tree corresponding to the above Tree is shown in the
following figure.

This Co-Tree has only three nodes instead of four nodes of the
given graph, because Node 4 is isolated from the above Co-Tree.
Therefore, the Co-Tree need not be a connected subgraph. This Co-
Tree has three branches and they form a loop.
The number of branches that are present in a co-tree will be equal
to the difference between the number of branches of a given graph
and the number of twigs. Mathematically, it can be written as
Where, 𝑙 = 𝑏 − (𝑛 − 1)
𝑙 =𝑏−𝑛+1

 l is the number of links.

 b is the number of branches present in a given graph.
 n is the number of nodes present in a given graph.
If we combine a Tree and its corresponding Co-Tree, then we will
get the original graph as shown below.
The Tree branches d, e & f are represented with solid lines. The Co-
Tree branches a, b & c are represented with dashed lines.

4. Incidence Matrix (A):

Any oriented graph can be described completely in a compact
matrix form. Here we specify the orientation of each branch in the
graph and the nodes at which this branch is incident. This branch
is called incident matrix. When one row is completely deleted from
the matrix the remaining matrix is called a reduced incidence
matrix. Order of incidence matrix is (n*b).
 Properties of incidence matrix:
1. Number of non zero entries of row indicates degree of the node.
2. The non-zero entries of the column represents branch
connections.
3. If two columns has same entries then they are in parallel.
Procedure to form incidence matrix:

 aij = 1, if jth branch is incidence to ith node and direction is

away from node.
 aij = -1, if jth branch is incidence to i th node and direction is
towards from node.
 aij = 0, if jth branch is not incidence to ith node .
Example: Draw incidence matrix for the given graph.

Solution: In the above shown graph or directed graph, there are 4

nodes and 6 branches. Thus the incidence matrix for the above
graph will have 4 rows and 6 columns.

 Reduced Incidence Matrix [AR]:

If from a given incidence matrix [A], any arbitrary row is deleted,
then the new matrix formed will be reduced incidence matrix. It is
represented by symbol [AR]. The order of reduced incidence matrix
is (n-1)*b where n is the number of nodes and b is the number of
branches.
 5. Tie-set:
It is a unique set with respect to a given tree of a connected graph
containing one chord and all of the free branches contained in the
free path formed between two vertices of the chord.

 Tie-set Matrix (Loop matrix)[B]: This matrix is used to

find the branch currents. For a given tree of a graph
addition of each link forms a closed path and in that
closed path current flows which is also the link current.
The current in any branch of a graph can be found by
using the link currents and their direction.
 Fundamental tie-set Matrix (Fundamental loop matrix)[B]: A
fundamental loop or a fundamental tie set of a graph with
respect to a tree is a loop formed by only one link associated
with other twigs. Since for each link of the tree there will be a
corresponding fundamental loop, the number of fundamental
loops is equal to the number of links in that tree. i.e.
Number of fundamental loops = b – (n-1).

 Procedure for forming the fundamental tie-set

Matrix:
1. A tree is selected arbitrarily in the graph.
2. Fundamental loops are formed with each link in the graph for the
entire tree.
3. Directions of the loop currents are oriented in the same direction
as that of the concerned link.
Fundamental tie-set matrix [Bij] is formed. Where,

Bij = 1 when branch bj is in the fundamental loop i and their

reference directions are same
Bij = -1 when branch bj is in the fundamental loop i and their
reference directions are opposite.
Bij = 0 when branch bj is not in the fundamental loop i.

Illustration: An oriented graph is shown in the figure 1(a) below.

Lets us select a tree arbitrarily as shown in the figure 1(b) below.
Then, the loops (tie sets) are formed as shown in the figure 1(c)
below.

(a) An oriented Graph (b) One of it’s Tree (c) The Loops (tie
sets) of the Tree

There are only two fundamental loops as there are only two links as
explained below:
1. Loop-1: Has current I1 and is formed with Twigs-1&5 and Link-4
2. Loop-2: Has current I2 and is formed with Twigs-1,2&5 and
Link-3
 Tie set analysis:

Consider an oriented graph, Tree and its co-tree

Graph Tree

Fig: loop analysis

 Let the branch currents in the network graph denoted by the
symbol‘IB’and various loop currents by symbol ‘iL’.

The orientation of a closed loop will be chosen to be the same as

that of its connecting link.

For the given network graph,

Number of branches, b = 8

Number of nodes, n= 5

Number of closed loops = [b–(n- 1)]

Where (n-1) = Number of tree branches

For a given network tree, tie set matrix is written as

After writing the schedule, the columns of a schedule or matrix

gives branch currents in terms of link currents.
I1= i1 ,
I2 = i2,
I3 = i3,
I4 = i4
I5 = i2-i1
I6 = i3-i2
I7 = i4-i3
I8 = i1-i4

The rows of the schedule give KVL equations in terms of coefficients

of the schedule

or matrix. i. e.
e1 - e5 + e8 = 0
e2 + e5 – e6 = 0
e3 + e6 – e7 = 0
 e4 + e7 – e8 = 0

Mathematically,the above equations are represented in matrix form,

i.e,

Ib = is a column matrix of branch currents of the order (bx1).

B = is the transpose of the fundamental tie-set matrix B.

Il = is a column matrix of loop currents or link currents of the order

(Lx1).

Where ‘L’ is the number of independent loops.

And

i.e,
where, Eb = is a column matrix of branch voltages of the order (bx1)

6. Cut-set:
It is that set of elements or branches of a graph that separates two
main 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 by which the network can be divided into two parts. A
cut-set is shown on a graph by a dashed line which passes through
the branches defining the cutest. A graph should have at least one
cutest though there can be more than one cut-set in any graph.

 Fundamental cut-set:
A fundamental cut set of a graph with respect to a tree is a cut set
formed by one and only 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. For a graph having N nodes there will be (n-1) fundamental cut-
sets ( i.e. equal to the number of twigs). As a convention, the
orientation of cutest is so chosen that it coincides with the
orientation of it’s twig.

 Cut-set Matrix[C]: This matrix provides a compact and

effective means of writing all the algebraic equations giving
branch voltages in terms of the tree branches.
 Procedure for forming the fundamental Cut-set
Matrix:
1. A tree is selected arbitrarily in the graph.
2. Fundamental cut-sets are formed (i.e. The network is divided
into two parts) with each twig in the graph for the entire tree.
3. Directions of the cut-sets are oriented in the same direction as
that of concerned twig.
Fundamental cut-set matrix [Ckj] is formed
 where ,Ckj = 1 when branch bj has same orientation as that of the
cut-set k
Ckj = -1 when branch bj has opposite orientation to that of
the cu-set k
Ckj = 0 when branch bj is not in the cut-set k.

Illustration: An oriented graph is shown in the figure 1(a) below.

Lets us select a tree arbitrarily as shown in the figure 1(b) below.
Then, cut-sets are formed as shown in the figure 1(c) below.

(a) An oriented Graph (b) One of it’s Tree (c) The cut-sets
of the Tree

The three fundamental cut-sets are given below

1. Cut-Set-1: Twig-2 and Link-3
2. Cut-Set-2: Twig-5 and Links-3&4
3. Cut-Set-3: Twig-1 and Links-4&3

 The following points are to be noted:

1. The number of fundamental Cut-sets are same as the number of
Twigs represented by bold lines.
2. Each Cut-set has only one twig.
3. The direction of the- cut-sets is indicated with arrows on them
(same as that of the corresponding twig).
Thus we can now frame the fundamental cut-set matrix as shown
below:

 Cutset Analysis:
Principle of Duality:
Duality: is the mutual relationship.
Consider a network containing R, L & C elements connected in series and
excited by a voltage source as shown.

The integro-differential equations for the circuit is,

Consider a network containing R, L & C elements connected in parallel and driven by a

current source as shown.

The integro- differential equations for the circuit is,

If we observe both the equations, the solutions of these equations are the same.
Therefore, these two networks are called duals.
Procedure to draw a Dual Network:
Step 1: In each Loop of a given network place a node and place an extra node called
reference node outside the network
.
Step 2: Draw the lines connecting adjacent nodes passing through each element and
also to the reference node by placing the dual of each element in the line
passing through original elements.

Example: 1) Draw the dual of a network for given network shown in figure.

Sol: Dual Network is ,

Redraw circuit,

Example: 2) Draw the dual of the network shown in figure.

Sol:

Dual network is,