NETWORK TOPOLOGY

(GRAPH THEORY)
 NETWORK TOPOLOGY
(GRAPH THEORY)

• Network topology is a graphical

representation of electric circuits.

• It is useful for analyzing complex electric

circuits by converting them into network
graphs.
• Network topology is also called as Graph
theory.
Terminology and Definitions
Network:
• A combination of two or more network
elements is called a network.

Topology:
• Topology is a branch of mathematics which is
concerned with the properties of geometrical
forms which are invariant under certain
transformations.
Network Topology:
• It is the study of network properties by
investigating the interconnections between the
branches and nodes of the network.

• It is concerned with geometric features of the

network.

Circuit:
• If the network has at least one closed path it is a
circuit.
• Note that every circuit is a network but every
network is not a circuit.
Branch:
• Representation of each element (component)
of a electric network by a line segment is a
branch.
• A branch is a line segment that connects two
nodes.
Graph (or linear graph):
• Network graph is simply called as graph.
• It consists of a set of nodes connected by
branches.
• When all the elements in a network are
replaced by lines with circles or dots at both
ends, the voltage sources are replaced by
short circuits and current sources are replaced
by open circuits, configuration is called the
graph of the network.
• Network

• Graph
Path:
• A sequence of branches traversed in going
from one node to another is called a path.
Node:
• A node point is defined as an end point of a
line segment and exits at the junction
between two branches or at the end of an
isolated branch.
Degree of a node:
• It is the no. of branches incident (or
connected) to it.
Loop (Closed Path):
• The set of edges (branches) traversed starting
from one node and returning to the same
node form a closed path or loop.

Planar and Non-planar Graphs:

• A planar graph is one where the branches do
not cross each other while drawn on a plain
sheet of paper. If they cross, they are non-
planar.
 TYPES OF GRAPHS

Following are the types of graphs

1. Connected Graph
2. Unconnected Graph
3. Directed Graph
4. Undirected Graph
Connected Graph:
• If there exists at least one path from each
node to every other node, then graph is said
to be connected.
• If there exists at least one branch between any
of the two nodes of a graph, then it is called as
a connected graph.
• Example:
Un-connected Graph:
• If there exists no path from each node to
every other node, the graph is said to be un-
connected 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.
Directed (or Oriented) 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.
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 unoriented graph.
Subgraph and its Types
•A part of the graph is called as a subgraph. We
get subgraph 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 subgraph.
• 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 Twigs.

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.
If we combine a Tree and its corresponding
Co-Tree, then we will get the original graph
as shown below.

Relation between twigs and links:

• Let N=no. of nodes
• L= total no. of links
• B= total no. of branches
• No. of twigs= N-1
• Then, L= B-(N-1)
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) branches.
• 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.
• we discussed how to convert an electric circuit
into an equivalent graph. Now, let us discuss
the Network Topology Matrices which are
useful for solving any electric circuit or
network problem by using their equivalent
graphs.
Matrices Associated with Network Graphs
Following are the three matrices that are used in
Graph theory.
• Incidence Matrix
• Fundamental Loop Matrix
• Fundamental Cut set Matrix
Incidence matrix [A]:
• 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.

• Here we specify the orientation of each

branch in the graph and the nodes at which
this branch is incident.
• This matrix is called incident 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.

• The rows of the matrix represent the nodes

and the columns represent the branches of
the graph.

• The elements of the incidence matrix will be

+1, -1 or zero.
• 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 a branch is not connected to a given node
then the corresponding element is marked
zero.
Complete incidence matrix:
• An incidence matrix in which the summation of
elements in any column is zero is called a
complete incidence matrix.

• It is an N × B matrix with elements of

• akj = 1, when the branch is incident to and

oriented away from the kth node.
= −1, when the branch is incident to and
oriented towards the kth node.
= 0, when the branch is not incident to the kth
node.
• As each branch of the graph is incident to
exactly two nodes,

Procedure to find Incidence Matrix

• Select a node at a time of the given directed
graph and fill the values of the elements of
incidence matrix corresponding to that node
in a row.
• Repeat the above step for all the nodes of the
given directed graph.
• Example
Consider the following directed graph.
Reduced incidence matrix [R]
• When one row is completely deleted from the
incidence matrix, the remaining matrix is
called a reduced incidence matrix.
• Number of trees in a graph: |[R][R]T|
TIE-SET MATRIX (or) LOOP MATRIX
• It is the matrix that is used to find the branch
currents.
• For a given tree of a graph, addition of each
link forms a closed path or loop.
Fundamental TIE-SET matrix (B)
(Fundamental LOOP matrix):
• 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.
• So, the number of f-loops will be equal to the
number of links b-(n-1).
• It is also called as fundamental circuit matrix.
• This matrix gives the relation between branch
currents and link currents.
• The fundamental loop matrix will have ‘b-n+1’
rows and ‘b’ columns.
• Here, rows and columns are corresponding to
the links of co-tree and branches of given
graph. Hence, the order of fundamental loop
matrix will be (b - n + 1) × b.
• The elements of fundamental loop matrix will
be having one of these three values, +1, -1
and 0.
• Procedure of obtaining Fundamental LOOP
Matrix or Fundamental TIE-SET matrix :
1. Arbitrarily a tree is selected in the graph.
2. Form fundamental loops with each link in the
graph for the entire tree.
3. Assume directions of loop currents oriented
in the same direction as that of the link.
4. Form fundamental tie-set matrix [Bik] where
• Bik = 1 when branch bk is in the fundamental
loop i and its current direction is same to
reference direction (of f-loop).
• Bik = -1 when branch bk is in the fundamental
loop i and its current direction is opposite to
reference direction (of f-loop).
• Bik = 0 when branch bk is not in the
fundamental loop i
Fundamental Cut-set Matrix:
• 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.