Euler and Hamiltonian Graph Problem - Graph Theory - Discrete Mathematics

[@VaibhavDeshmukh-gg1jl]

1 hour 40 minutes before exam

[@Hershesvlogs]

Us

[@VKG18]

​@@Hershesvlogs same

[@MuraliInti-e5u]

Same

[@mememariyo7454]

Same here

[@VKG18]

@@mememariyo7454 sppu?

[@rohankumarpandit4982]

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

[@DersoZelalem]

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

[@at710-cl6of]

@@missjhilik7849 -not understood ,what you said

[@382_alamin8]

very good teacher❤

[@sagarsoni7496]

Eulerian is prounanced as "oilerian" not youlerian.

[@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.

[@LokeshKamineni-l2e]

❤❤❤

[@rishav4433]

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

[@sayalsingh9904]

5 min into exam

[@WaqasGul-sb5nq]

Unsatisfied quality of video 😢

[@WaqasGul-sb5nq]

Quality of video is not satisfied