Tie set and tie-set matrix

4,331 views 19 slides Dec 18, 2020
Slide 1
Slide 1 of 19
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19

About This Presentation

Tie set Matrix


Slide Content

Tie Set and Tie Set Matrix Mrs.V.SrirengaNachiyar , Assistant Professor (Sr. Gr.), Department of Electronics and Communication Engineering , Ramco Institute of Technology, Rajapalayam

TIE-SET A tie - set is a set of branches that form a closed path in a graph such that the closed path contains one link and remainders are twigs. The closed path is also known as loop. A tree of a graph does not have any closed path . Upon adding a link to the tree a closed path or loop is created. Therefore on adding each link creates one loop and So the number of loops in a graph will be equal to number of links.

TIE-SET In other words, the number of tie-sets will be equal to number of links. For a graph with b branches and n nodes, the possible tie-sets are given by ( b − n + 1). The tie-set is also called as fundamental circuit or f - circuit . Therefore, a fundamental tie-set is a tie-set formed by one and only one link and a set of twigs.

TIE-SET

TIE SET MATRIX Tie set matrix is used to describe the way in which the branches constitute loops or circuits in a graph . An arbitrary orientation is specified for each loop using an ordered list of its branches and nodes. The reference direction of the f-loop is taken as that of the link .

TIE SET MATRIX

TIE SET MATRIX

TIE SET MATRIX

TIE SET MATRIX

TIE SET MATRIX Example Tree 1

TIE SET MATRIX Example Tree 1

TIE SET MATRIX Example Tree 1

TIE SET MATRIX Example Tree 1

TIE SET MATRIX Example Tree 2

TIE SET MATRIX Example Tree 2

TIE SET MATRIX Example Tree 2

TIE SET MATRIX Example Tree 3

TIE SET MATRIX Example Tree 3

TIE SET MATRIX Example Tree 3
Tags