00:01
Hello students, in the question we are given network graphs.
00:04
Let us first understand a few terms.
00:07
We have termed directed edges.
00:13
Directed edges are drawn as arrows pointing from one vertex to another.
00:38
So here we have two vertices and this is a directed edge.
00:47
Directed edge.
00:53
Let us again consider two vertices.
00:56
We have an edge connecting them.
00:58
Here there is no arrow.
01:00
This is undirected edge.
01:05
Now between these two vertices, here we have multiple edges.
01:16
So this is multiple edge or parallel edge.
01:29
While for a directed graph, multiple edges, it would look like this.
01:35
Arrows would be in the same direction.
01:37
It is an edge that connects a vertex to itself.
01:59
So here this is example of a loop.
02:05
Also simple graphs, these are graphs with no multiple edges and no loops.
02:28
Now let us look at graph 3.
02:34
Here we can see that all edges, they are undirected.
02:37
So here this graph is undirected graph.
02:47
All the vertices are connected.
02:49
So it is a connected graph.
02:55
Also there are no multiple edges or loops.
02:58
So this is a simple graph.
03:03
Let us look at graph number 4.
03:07
Here we have multiple edges.
03:11
These are also multiple edges present.
03:19
And here we can see edges are undirected.
03:21
So this graph is undirected graph...