Hamiltonian Graph | Details|Graph Theory #17

[@jigyasaagrawal5876]

sir your videos helped me alot in studying and taking my exam . thank you so much !

[@jigyasaagrawal5876]

your teaching style is fantastic thanks a lot

[@himaanshu1]

Thanks for all the videos.. really helped me..

[@saishwadkar4557]

Hi Sir, please make video on P and Np problems NP Complete and NP hard. Your teaching style is fantastic!

[@neethu5637]

Ur Teaching Is Amazing i loved it Tqq soo much sir

[@wonderfulmusiclofi]

I really appreciate your teaching technique...

[@avisalan6621]

thank you for the great and simple explanation. 😊

[@judeshello5782]

Excellent work

[@sheetalhemram21]

Sir upload videos on dirac's and ore's thm. Quickly.

[@satishkolli5457]

Good explanation sir

[@kaustubhpaturi4801]

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?

[@shivupatil6403]

Sir pls make classes on planar graphs and it 'theorems. And also on colorability

[@andersonlima4440]

3:38 How could an edge be visited more than once, if the vertices cannot?

[@reamabdulsalam524]

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

[@Navarasa.rhythm524]

Sir, can you make a vedio for find graph is planar or not

[@nallamaruchandrasekhar3094]

sir could you please explain grinberg's theorem and explain how to find hamiltonian cycle using grinberg's theorm

[@amonprincefootballdoc6240]

you are a genius

[@nandhushree3914]

PDE sum pls upload sir.your teaching excellence

[@santhosh........]

Super sir It will be really helpful

[@kanimozhibalaji9925]

Hi sir pls make a video on isomorphism in graph theory and how to check whether the graph is isomorphism or not.

[@hemmlo5975]

Same nmbr of vertex Same nmbr of edges Same degree of corresponding vertex

[@shubhamtandan486]

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 ?

[@rajivmishra103]

repeatation of edge can not be done.

[@abhyudayakumar24]

Repetition of edge is not possible there

[@ayushgarg5929]

Nahi kar sakte edge do baar visit warna 2 vertex more than once visit ho jaayenge... chutiya hai teacher

[@st_sk5705]

Please make problem solving videos on graphs

[@vasudevans8959]

Sir I want extensions,spiliting field, normal extensions, galos extension, seperable in algebra

[@لُطف-ب9خ]

Thank you sir 🤍🙏 .

[@goravchokade1198]

Plz!! Make a video on how to convert an expresion in binary tree..

[@fitrisalsabilaayuandriani7084]

Thank you so much sirr!!

[@kaltube4817]

keep it up!👍👍

[@markKebba]

thanks alot

[@karana2260]

who knew behind our school copies we were looking for best hamiltonian path :D :D

[@amitmauryathecoolcoder267]

Thank you, bhaiya...

[@govindjangid6201]

Thanks sir ji

[@Feenaq87667]

Thanks sir

[@kassadamitie3351]

I BOUNDARY SO MUCH

[@alambansdancecompany3]

Tnx sir

[@epicclips8881]

Thank u

[@letsstudywithme5666]

I think aap hindi me or better se explain kr skte the