Scribd
Upload
4 views10 pages

Singular Transformation Method-Introduction

The document discusses the formation of the Y-bus matrix through singular transformation, detailing key concepts such as networks, graphs, branches, nodes, loops, and trees. It explains the properties of trees and cotrees, as well as the primitive impedance matrix, which contains information about transmission lines. Additionally, it describes how the direction of current affects the sign of impedance in the matrix.

Uploaded by

palanisamy8442
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views10 pages

Singular Transformation Method-Introduction

The document discusses the formation of the Y-bus matrix through singular transformation, detailing key concepts such as networks, graphs, branches, nodes, loops, and trees. It explains the properties of trees and cotrees, as well as the primitive impedance matrix, which contains information about transmission lines. Additionally, it describes how the direction of current affects the sign of impedance in the matrix.

Uploaded by

palanisamy8442
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

FORMATION OF Y-BUS BY

SINGULAR TRANSFORMATION

1
Network
- An interconnection of elements in various branches of different
nodes.

2
Graph
- Representation of network
obtained by replacing every element of
network by a line segment and every
junction point by a node.
Oriented Graph
- If every branch of a graph has
direction, then the graph is called as a directed
graph or oriented graph.

3
Branch or edge
- A branch is represented by a line segment in the
graph of a network.

Node or bus or vertices


- A terminal of a branch is represented by a point.

Loop or closed path


- If the starting node and ending node is same for a path, then it is called as
closed path or loop.

4
Tree or twig
• A tree is a subgraph of a network which consists of all the nodes as in the graph
but has no closed paths.

Properties of a tree

 Number of nodes in a graph=number of nodes of that graph.


 All the nodes must be connected by elements called the tree branches.
 Tree branches must not form any loop or closed path in the subgraph.
 Every connected graph has at least one tree.
 Rank of tree=rank of a graph.
 Number of tree branches=number of nodes - one (n-1)

Examples of tree

5
Link or chord

• The removal branches of the tree is called the link.


• The branches of cotree is called link or chord.

Cotree
The set of all links of a given tree is called the cotree of the graph.

6
Primittive impedance matrix (𝑍𝑃𝑅𝐼𝑀𝐼𝑇𝑇𝐼𝑉𝐸 )
Primittive network:-
A network element may contain active and passive
components. A set of unconnected elements is primittive
network.
Impedance form:-

Admittance form:-

7
• If there is no mutual coupling between elements the
diagonals are impedances or admittances.
• Matrix which contain information about transmission line
(impedance) is called primittive impedance matrix.
• Size of the primittive impedance matrix is 𝑒 × 𝑒,
where, e − number of elements or branches.
• Diagonal elements – self impedance of elements.

8
Example

9
Direction of current is same, then the
direction of 𝑍𝑚 is positive.

Direction of current is opposite, then


the direction of 𝑍𝑚 is negative.

10

You might also like