Euler and Hamiltonian Graph Problem - Graph Theory - Discrete Mathematics

Subject - Discrete Mathematics
Video Name - Euler and Hamiltonian Graph Problem
Chapter - Graph Theory
Faculty - Prof. Farhan Meer
Upskill and get Placements with Ekeeda Career Tracks
Data Science - ekeeda.com/car...
Software Development Engineer - ekeeda.com/car...
Embedded and IOT Engineer - ekeeda.com/car...
Get FREE Trial for GATE 2023 Exam with Ekeeda GATE - 20000+ Lectures & Notes, strategy, updates, and notifications which will help you to crack your GATE exam.
ekeeda.com/cat...
Coupon Code - EKGATE
Get Free Notes of All Engineering Subjects & Technology
ekeeda.com/dig...
Access the Complete Playlist of Subject Discrete Mathematics - • Discrete Mathematics
Happy Learning
Social Links:
/ ekeeda_official
/ ekeeda.com
#GraphTheory #DiscreteMathematics

[@rohankumarpandit4982]

Thank you sir .. I got to understand very well..❤

[@VaibhavDeshmukh-gg1jl]

1 hour 40 minutes before exam

[@382_alamin8]

very good teacher❤

[@user-wh4pj8vw7j]

Draw two graphs each with 10 vertices and 13 edges: one that is Eulerian but not Hamiltonian and
one that is Hamiltonian but not Eulerian.

[@tshwareloshabalala8394]

For example 1 you didn’t label and visit the middle vertex. The are five vertices there not four

[@missjhilik7849]

Degrees Are even...not vertices

[@meronasmerom7625]

for example 2 (eulerian but not Hamiltonian )you visited C twice for the closed Euler path

[@tshwareloshabalala8394]

That is fine. Repeated vertices are allowed for Eulerian. We encounter problems if we repeat edges which he has not done.

[@rishav4433]

sir your intro is very irritating .its too noisy.all though your explanation is great

[@WaqasGul-sb5nq]

Unsatisfied quality of video 😢

[@WaqasGul-sb5nq]

Quality of video is not satisfied