🌟 MCA Gold Medalist 🌟 Star Educator 🌟Gate Qualified 🔴UGC NET qualified🌟BOOK published on LINUX ADMINISTRATION by kalyani publish

Nisha Mittal

In this course Nisha Mittal will provide solutions of questions of graph theory.  Also you will understand  important topics with the help of these lessons .

Prepare for UGC NET 2019 by watching our free online lessons covering UGC Net syllabus and also helping you solve Previous year question papers. Pursue your dream of JRF.

NTA-UGC-NET & SET Exams

Hindi

(Hindi) Graph Theory Previous Year Question with Solution

Discrete Probability

Discrete Structure & Optimization

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

Overview of the Course (in Hindi)

Graph Colouring (in Hindi)

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

Chromatic Number (in Hindi)

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

Recognise isomorphic graph( in Hindi)

Find planer and non planer graph (in Hindi)

Find planet graph from these graphs( in Hindi)

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

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

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

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

Depth First Search (DFS) sequence( in Hindi )

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

MCQs Graph theory( in Hindi)

Isomorphic to the given graph(in Hindi)

What is Hamiltonian Graph ?( in Hindi )

Non planer graph related question (in Hindi)

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

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

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

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

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

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

Topological ordering (in Hindi )

Weighted connected undirected graph( in Hindi )

Find topological ordering of this graph( in Hindi )

Bounded faces in a graph (in Hindi )

In this course, the educator Nisha Mittal will provide solutions of questions related to propositional logic. This topic is very important for UGC NET computer science, Gate, KVS PGT,  HTET aspirants

(Hindi) Propositional Logic-Computer Science: NTA UGC NET

In this course Nisha Mittal will provide solutions of questions of set theory for NTA NET computer science. Here you will understand all important topics of set theory with the help of questions .

(Hindi) Set Theory for NTA UGC NET Computer Science Examination

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Tricks To Solve Propositional logic in Discrete Mathematics - UGC NET CS 2019.

(Hindi) Tricks to Solve Propositional Logic in Discrete Mathematics - UGC NET CS 2019

In this course Nisha Mittal will provide topic detail and  solutions of questions of NTA NET computer science examination related to discrete structure topic : relation and Function.

(Hindi) Relation and Function for NTA UGC NET: Computer Science

In this course Nisha Mittal will provide solutions of Functions topic of discrete structure questions for NTA NET computer science examination. This course will be helpful to GATE computer science, KVS PGT, TGT computer science students also

(Hindi ) Function-related Important Questions: NTA-UGC NET

Lessons

29 lessons • 2h 38m

Invalid Date

NaN

Overview of the Course (in Hindi)

Invalid Date

NaN

Graph Colouring (in Hindi)

Invalid Date

NaN

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

Invalid Date

NaN

Chromatic Number (in Hindi)

Invalid Date

NaN

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

Invalid Date

NaN

Recognise isomorphic graph( in Hindi)

Invalid Date

NaN

Find planer and non planer graph (in Hindi)

Invalid Date

NaN

Find planet graph from these graphs( in Hindi)

Invalid Date

NaN

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

Invalid Date

NaN

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

+ See all lessons