Overview of the Course (in Hindi)

Overview of the Course (in Hindi)

2:28mins

Graph Colouring (in Hindi)

5:35mins

Minimum Number of Colours Required to Color a Graph (in Hindi)

5:19mins

Chromatic Number (in Hindi)

5:20mins

Check your Solution to Find Chromatic Number of this Graph (in Hindi)

5:14mins

Recognise isomorphic graph( in Hindi)

7:25mins

Find planer and non planer graph (in Hindi)

5:03mins

Find planet graph from these graphs( in Hindi)

5:23mins

Graph cannot be planar if it contains a Kuratowski subgraph( in Hindi)

8:17mins

Topological Sorting of vertices of a Directed Acyclic Graph (in Hindi)

5:20mins

Kuratowski’s Theorem to find minimum number of vertices( in Hindi)

7:04mins

Maximum number of edges in a n – node undirected graph( in Hindi )

4:56mins

Depth First Search (DFS) sequence( in Hindi )

4:21mins

Prim’s algorithm to construct a minimum spanning tree (in Hindi )

5:18mins

MCQs Graph theory( in Hindi)

5:20mins

Isomorphic to the given graph(in Hindi)

4:25mins

What is Hamiltonian Graph ?( in Hindi )

6:30mins

Non planer graph related question (in Hindi)

4:31mins

What is the number of vertices in undirected connected graph (in Hindi)

5:37mins

TRUE for any simple connected undirected graph with more that 2 vertices?( In Hindi )

4:46mins

The number of leaf nodes in the binary tree (in Hindi)

4:19mins

Minimum spanning tree using kruskal's algorithm( in Hindi)

5:24mins

Minimum spanning tree using prim's algorithm( in Hindi )

5:51mins

The number of edges in a regular graph of degree d and n vertices is (in Hindi )

6:24mins

Topological ordering (in Hindi )

7:06mins

Weighted connected undirected graph( in Hindi )

5:30mins

Find topological ordering of this graph( in Hindi )

5:42mins

Bounded faces in a graph (in Hindi )

5:07mins

Bounded faces in a graph (in Hindi )

5:07mins