Professional Documents
Culture Documents
UNIT -2 Syllabus ……
Definitions
Graph ,Tree
Basic cut set & Tie Set Matrices for planar networks
Loop method of analysis using graph theory
Nodal method of analysis using graph theory
Duality and Dual network
What is Network Topology
Network topology is arrangement of various elements
(links, nodes ,etc.) of a electrical network such that
there is no distinction between different types of physical
elements of network. Instead this study is based on a
geometric pattern of a network.
Essential Node
Branch
Loop
Mesh
Graph
h i
j k
Definition Number Example
present
Essential Node A node that joins three or more elements. 04 b, c,e and g
(Junction)
Mesh A mesh is a special type of loop which does 04 abedca,cdegfc, gebhjg ,jhik
not contain any other loops within it.
Tree & Twigs : A connected sub graph having all the nodes of a graph
without any loop is called a tree and branches of a tree are
called twigs.
Properties of Tree
. There exists only one path between any pair of nodes in a tree
A tree contains all nodes of the graph
If n is the number of nodes of the graph, there are (n-1)
branches in the tree
Tree do not contain any loops
Every connected graph has at least one tree
Number of possible trees of a graph = A𝐴𝑇
Identify Trees in the graph
Example 1
Co tree and Links of graph
Links or chord
- The branches that are removed from the graph while forming a
tree are termed as links or chords
Co - tree
2 • Incidence Matrix(A)
>
2 3
1 6
d
Complete Incident Matrix (Aa) Incident Matrix (A)
Tie set Matrix (B)
<--Nodes
⋯ Aij = 0, if branch j is not matrix of a connected
⋮ ⋱ ⋮ associated with node i. graph is (n–1).
⋯
nxb
Tie B Tie-Set is a set of branches Number of tie sets in
contained in a loop such that each Bij=1 if branch j is in loop I and a tree is equal to the
set loop contains one link or chord and their orientations coincide number of links of
Matrix the remainder are tree branches. the tree
Bij=-1,if branch j is in loop I and As tie set traces a
Branches their orientations do not Coincide.
loop it is used
<--- Tie sets
⋯
⋮ ⋱ ⋮ Bij=O, if branch j is not in loop i. conveniently to apply
⋯ KVL
lxb
⋯ remaining elements
Qij = 0, if branch j is not in the
⋮ ⋱ ⋮ being links.
cut-set i.
⋯ txb
MATRIX KCL KVL
Incidence Matrix
(A)
A X Ib = 0 Vb = 𝐴𝑇 x Vn
(8)
(6)
Example
Step 1: place a node inside each mesh of the given network. These internal
nodes correspond to the independent nodes in the dual network.
Step 2: place a node outside the given network. The external node
corresponds to the datum node in the dual network.
Step3 : Connect all internal nodes in the adjacent mesh by dashed lines
crossing the common branches. Elements which are the duals of
the common branches will form the branches connecting the
corresponding independent nodes in the dual network