Scribd
Upload
33 views

Deep Nandi Branch:-Ee (2 Year) ROLL NO. - 31

This document discusses graphs and trees as they relate to electrical networks. It defines key terms like branches, nodes, trees, and loops. It provides properties of trees, such as having n-1 branches for a graph with n nodes and no closed paths. The document also discusses incidence matrices, cut-set matrices, and loop matrices which relate the direction of branches, cut-sets, and loops. Formulas are provided for relationships between branches and nodes in a tree.

Uploaded by

DossDoss
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
33 views

Deep Nandi Branch:-Ee (2 Year) ROLL NO. - 31

This document discusses graphs and trees as they relate to electrical networks. It defines key terms like branches, nodes, trees, and loops. It provides properties of trees, such as having n-1 branches for a graph with n nodes and no closed paths. The document also discusses incidence matrices, cut-set matrices, and loop matrices which relate the direction of branches, cut-sets, and loops. Formulas are provided for relationships between branches and nodes in a tree.

Uploaded by

DossDoss
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/ 14

BY DEEP NANDI

BRANCH:- EE(2nd year)


ROLL NO.- 31
When all the elements (e.g. R, L,C)
in a network are replaced by lines
with circles or dots at both ends the
configuration is called graph of the
network.
 BRANCH
 NODE
 TREE
 TREE LINK
 TREE BRANCH
 LOOP
 MATRIX
: A branch is a line segment representing one
network element or a combination of element
connected between two points.

: A node point is defined as an end point of


a line segment and exist at the junction between two
branches.

: It is an inter connected open set of branches


which include all the nodes of given graph.
1
2

3
PROPERTIES OF TREE
 It consist of all the nodes of the graph .
 If the graph has n number of nodes the tree will n-1
number of branches
 There will be no closed path in the tree .
 There can be many possible different for a given graph
depending on the number of nodes and branches.
INCIDENCE MATRIX
 Row -> node , column -> branch
 Algebraic sum of column entries of an incidence matrix
is zero.
 Determinant of incidence matrix of a closed loop is
zero .

1 2 3
1 2

4
3
5
 Row -> cut-set , column -> branch
 Draw the tree of the graph .
 Take the direction of cut-set as the twig
direction .
 The direction along the branch of cut-set
is taken as positive one and if the
direction is opposite it is taken as
negative one .
5

1 2 3
3 4

1 6
2

4
 R0w -> loop current , column -> branches
 Draw the tree from the given graph
 Take the direction of loop as a link direction.
 The branch having the same direction as a loop
direction is taken as 1 and if opposite direction it is
taken -1.
1 2
2 3
1

I 4 5
3

4
 Relation between twig and link L=B-N+1
 If the graph as N number of nodes , tree will have N-1
branches.
 Number of trees of a graph T = determinant [A].[A]^t
 Orthogonal relationship [A].[B]^t =0 or [B][A]^t = 0
 [Vb] = [Q]^t .[Vt]
 [Vb] = [A]^t[Vn]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy