00:02
Hello students, today we will discuss about this question.
00:04
In this question we need to draw all the graphs on five nodes in which every node has degree at least two.
00:30
So here first of all, we know that a degree of a node, the degree of a node, the degree, of a node is the number of edges connected to the node.
00:56
In terms of agency matrix a, the degree for a node indexed by i in an undirected network, that is ki, that is equals to summation of j, a, i, j, j.
01:16
Where the sum is over all the nodes in the network and in a directed network each node has two degree.
01:27
So the out degree is number of outgoing edges eliminating from a node and in degree is the number of incoming edges onto a node.
01:39
So here, in this question we need to give a five nodes, five nodes in which every nodes has degree at most two.
02:05
So here, that are the five nodes.
02:12
Suppose this will be one.
02:18
Suppose here we can write like this...