@@animestaanamv2866 no, hamiltonian means it should cover all the vertices ( exactly once ) without repeating the vertex , and agar vertex repeat nai kar sakte toh obvio edge bhi repeat nai kar sakte
Sufficient theorem h bhai....agar theorem apply nahi ho paata tab bhi woh hamiltonian graph ho sakta h...uske liye start vertex aur end vertex same hone chahiye...aur har ek vertex ek he baar include honi chahiye in cycle
This video is so good . The way he describes every thing is so easy to understand. He deserves more views and love
very useful videos sir 👍
Thanks sir for giving exactly point of ore and dirac theorem
Very Good Explanation! You made the concept clear :)
Excellent sir...
Excellent teaching👍
Sir g luv uh .....whatt ab explanation ❤❤❤
Great teacher.
Sir jb dirac thoerm thi to ore theorem se kya hi fayda hua.... Different hua kuchh?
can we calculate the total degree of vertext like deg(total) >= n/2 is it correct?
Sir the first example is a Hamiltonian graph sir ,if start form the below vertex
no it is not because you cant form a cycle on that graph when it has a degree 1 so you cant return to the same vertex.
Sir edge repeat ho to wo kiya Hamiltonian Circuit banega
Yes banega
@@animestaanamv2866 no, hamiltonian means it should cover all the vertices ( exactly once ) without repeating the vertex
, and agar vertex repeat nai kar sakte toh obvio edge bhi repeat nai kar sakte
Asalam o alaikum sir kindly octahedron graph ka eulerian circuit find kr dain
Thank you Sir 🙏🙏🙏🙏❤️❤️❤️
Bro Direc theorem true for simple graph
Sir apki padhai me meja aa rahahe
you have a mistake in the correction of no 3 . if you start vertices from the below ones that might make a hamiltoin path but not hamiltonian circuit
you have also mistake in the correction of number 4 . you have lots of mistakes
I am filling ans sheet in examination hall waiting for question paper while watching this vedio
😀😃😄😁😆😅🙂🙃
Very Helpful ❤️❤️SIR
nice
Direcs theorem mai : agar Sare vertices ka degree alag alag ho taab formula kaise use karunge ?
Sufficient theorem h bhai....agar theorem apply nahi ho paata tab bhi woh hamiltonian graph ho sakta h...uske liye start vertex aur end vertex same hone chahiye...aur har ek vertex ek he baar include honi chahiye in cycle
Aapne ek bhi theorem nhi batya but thumbnail mai kyon likha hai fir😠
lol