B.C.S.( University Topper), MSc.Computer Sci, MH SET Qualified, NTA NET Qualified having 6 years of teaching experience.

Pinky Sawalani

This course discusses in detail about Graph Theory concepts with previous year questions. Important topic of NTA NET Computer science and Applications.

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) Complete Course on Graph Theory- NTA NET Computer Science and Applications

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 definition, Undirected Graphs, Directed Graphs, Adjacent vertices, Adjacent edges (in Hindi)

(Hindi) Some basic concepts and different types of Graph in single page with examples.

Self loop, Parallel edges, Different types of Graphs (in Hindi)

(Hindi) Degree of a vertex, Regular Graph, Complete Graph, Finite and infinite graphs, Null and Trivial graphs.

Degree of a vertex,Complete and Regular Graph, Finite Graph, Infinite Graph, Null Graph (in Hindi)

(Hindi)Very important theorems  "Handshake lemma" and "odd degree  vertices are always even in number" and practice problems.

Handshake Lemma and Practice Problems (in Hindi)

(Hindi) In degree and Outdegree of a Directed Graph. PYQ based on theorem odd degree vertices are always even in number.

Indegree and outdegree in a Directed Graph(in Hindi)

(Hindi) Walks, Paths and circuits in  detail with examples.

Walk, Paths and circuits(in Hindi)

Euler Graph , konisberg seven bridge problem, To identify whether graph is Euler or not.

Euler Graph, Seven bridges of konisberg and theorem on Euler Graph with examples(in Hindi)

(Hindi) Hamiltonian graph and some graph examples for identifying whether graphs are Euler or Hamiltonian.

Hamiltonian Graph with examples(in Hindi)

(Hindi) Dijkstra's Shortest path algorithm with example.

Dijkstra's shortest path algorithm with example(in Hindi)

Explanation of Dijkstra's Shortest path algorithm with the help of previous year gate question.

Explanation of Dijkstra's shortest path algorithm with previous year gate question(in Hindi)

Concept of Bipartite Graph with examples.

Bipartite Graph with example(in Hindi)

Complete Bipartite Graph in detail with examples and understanding how to find the number of vertices and edges in Complete Bipartite Graph.

Complete Bipartite Graph with example(in Hindi)

Concept of Planar graph and non planar graph with examples.

Planar Graph and Non Planar Graph with examples(in Hindi)

Regions in Planar Graph in detail with example,Degree of Region, Euler's formula with example.

Regions in a planar graph, degree of region and Eulers formula with examples(in Hindi)

Degree of a region is atleast 3, sum of degrees of regions is equal to twice the number of edges, e<=3v-6 if v>=3.

Some important statements about region in a planar graph( in Hindi)

Graph coloring in detail with chromatic number of a graph with examples.

Graph colouring and chromatic number of a graph( in Hindi)

Chromatic number of a complete graph, Complete Bipartite Graph with examples.

Chromatic number of a complete graph and complete Bipartite graph with examples(in Hindi)

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

Nisha Mittal

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

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 .

(Hindi) Graph Theory Previous Year Question with Solution

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

Lessons

18 lessons • 3h 17m

Invalid Date

NaN

Overview of the Course (in Hindi)

Invalid Date

NaN

Graph definition, Undirected Graphs, Directed Graphs, Adjacent vertices, Adjacent edges (in Hindi)

Invalid Date

NaN

Self loop, Parallel edges, Different types of Graphs (in Hindi)

Invalid Date

NaN

Degree of a vertex,Complete and Regular Graph, Finite Graph, Infinite Graph, Null Graph (in Hindi)

Invalid Date

NaN

Handshake Lemma and Practice Problems (in Hindi)

Invalid Date

NaN

Indegree and outdegree in a Directed Graph(in Hindi)

Invalid Date

NaN

Walk, Paths and circuits(in Hindi)

Invalid Date

NaN

Euler Graph, Seven bridges of konisberg and theorem on Euler Graph with examples(in Hindi)

Invalid Date

NaN

Hamiltonian Graph with examples(in Hindi)

Invalid Date

NaN

Dijkstra's shortest path algorithm with example(in Hindi)

+ See all lessons