Scribd
Upload
59 views1 page

Netwrok Theory: Incidence Matrix (A)

This document discusses key concepts in network theory, including: - The number of twigs in a tree is equal to the number of nodes minus one, and the remaining branches are called links. - The incidence matrix of a graph records the connections between nodes and branches, with its determinant being zero for closed loops. - Fundamental loop and cut set matrices describe the minimum loops and cuts within a graph, relating to the numbers of links and twigs.

Uploaded by

Amit Rajput
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
59 views1 page

Netwrok Theory: Incidence Matrix (A)

This document discusses key concepts in network theory, including: - The number of twigs in a tree is equal to the number of nodes minus one, and the remaining branches are called links. - The incidence matrix of a graph records the connections between nodes and branches, with its determinant being zero for closed loops. - Fundamental loop and cut set matrices describe the minimum loops and cuts within a graph, relating to the numbers of links and twigs.

Uploaded by

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

IMPORTANT POINTS:

NETWROK THEORY
 The branches of a tree are called twigs or tree-branches.
 Number of Twigs = (N-1); N= Number of Nodes
 The Remaining branches are called Links & collection of Links is called Co-Tree.
 Number of Twigs = B-(N-1); N= Number of Nodes & B= Number of branches.
 The given graph is completely connected graph Number of Tree = 𝑁 (𝑁−2); N= Number of Nodes
 The Given graph is not a completely connected graph than the number of trees= Determinant of ( [𝑨𝒓 ]
[𝑨𝒓 ]𝑻 ); Where 𝑨𝒓 is reduced incidence matrix.
 Tree Should contain all the Nodes.

INCIDENCE MATRIX (A)

 The order of incidence matrix will be n × b.


 Algebraic sum Entries of an incidence matrix is Zero.
 Determinant of the incidence matrix of a closed loop is Zero.

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.

FUNDAMENTAL LOOP MATRIX (B) or TIE-SET MATRIX

 Fundamental loop or f-loop is a loop, which contains only one link and one or more twigs. So, the number of f-
loops will be equal to the number of links.
 The order of fundamental loop matrix will be (b - n + 1) × b.

FUNDAMENTAL CUT SET MATRIX(C) or CUT–SET MATRIX-

 Fundamental cut set or f-cut set is the minimum number of branches that are removed from a graph in such
a way that the original graph will become two isolated sub graphs. The f-cut set contains only one twig and
one or more links. So, the number of f-cut sets will be equal to the number of twigs.
 Order = Twig* Branches

You might also like