But sir, in the third example, if we start from a vertex that lies on the common edge btw the square and the triangle, we will not be visiting all the vertices. Then can we say that it is a hamiltonian cycle?
Hello can you please explain everything about graphs from starting to finish I have a subject which call algorithm which I am struggling teacher is bad so please explain everything from zero from the beginning
At 3:39 you are telling we can visit the edge more than once but as per your explanation hamiltonian circuit is a trail and trail has no repeated edges. Please explain this whether I am wrong or some mistake happened at that time ?
sir your videos helped me alot in studying and taking my exam . thank you so much !
Thanks for all the videos.. really helped me..
your teaching style is fantastic thanks a lot
I really appreciate your teaching technique...
Hi Sir, please make video on P and Np problems NP Complete and NP hard.
Your teaching style is fantastic!
Ur Teaching Is Amazing i loved it Tqq soo much sir
Thank you, bhaiya...
Super sir
It will be really helpful
Sir upload videos on dirac's and ore's thm. Quickly.
Thank you so much sirr!!
Excellent work
Thanks sir ji
Sir pls make classes on planar graphs and it 'theorems. And also on colorability
Good explanation sir
thanks alot
you are a genius
Plz!! Make a video on how to convert an expresion in binary tree..
Thank u
Thanks sir
Please make problem solving videos on graphs
Thank you sir 🤍🙏 .
sir could you please explain grinberg's theorem and explain how to find hamiltonian cycle using grinberg's theorm
PDE sum pls upload sir.your teaching excellence
keep it up!👍👍
Sir, can you make a vedio for find graph is planar or not
3:38 How could an edge be visited more than once, if the vertices cannot?
Hi sir pls make a video on isomorphism in graph theory and how to check whether the graph is isomorphism or not.
Same nmbr of vertex
Same nmbr of edges
Same degree of corresponding vertex
I BOUNDARY SO MUCH
But sir, in the third example, if we start from a vertex that lies on the common edge btw the square and the triangle, we will not be visiting all the vertices. Then can we say that it is a hamiltonian cycle?
who knew behind our school copies we were looking for best hamiltonian path :D :D
Hello can you please explain everything about graphs from starting to finish I have a subject which call algorithm which I am struggling teacher is bad so please explain everything from zero from the beginning
Sir I want extensions,spiliting field, normal extensions, galos extension, seperable in algebra
At 3:39 you are telling we can visit the edge more than once but as per your explanation hamiltonian circuit is a trail and trail has no repeated edges. Please explain this whether I am wrong or some mistake happened at that time ?
repeatation of edge can not be done.
Repetition of edge is not possible there
Nahi kar sakte edge do baar visit warna 2 vertex more than once visit ho jaayenge... chutiya hai teacher
I think aap hindi me or better se explain kr skte the
Tnx sir