Discrete Mathematics: Graph Theory (Part-2)

By Mukesh Kumar|Updated : November 17th, 2020

Eulerian Graph

If a graph contains “closed traversable trial or Euler circuit” (it may repeat vertices), then it is Eulerian Graph.

Note: ………………………………………………………………….

  • A graph G is traversable if the number of vertices with an odd degree in the graph is exactly zero or two.
  • Euler path exists but Euler Circuit doesn’t exist iff the number of vertices with an odd degree is exactly two.
  • Euler Circuit exists but Euler path does not exist iff number of vertices with an odd degree is 0.

……………………………………………………………………………….

Hamiltonian Path

If there exists a path which contains each vertex of the graph exactly once, then such a path is called as a Hamiltonian path.

Hamiltonian Cycle

It is the Hamiltonian path where first and last vertices are same.

byjusexamprep

byjusexamprep

byjusexamprep

byjusexamprep

You can follow the detailed champion study plan for GATE CS 2021 from the following link:

Detailed GATE CSE 2021 Champion Study Plan

Candidates can also practice 110+ Mock tests for exams like GATE, NIELIT with BYJU'S Exam Prep Test Series check the following link:

Click Here to Avail GATE CSE Test Series!(100+ Mock Tests)

Get unlimited access to 21+ structured Live Courses all 112+ mock tests with Online Classroom Program for GATE CS & PSU Exams:

Click here to avail Online Classroom Program for Computer Science Engineering

Thanks

The Most Comprehensive Exam Prep App!

Comments

write a comment

Follow us for latest updates