Graph Theory | Eulerian Graph & Hamiltonian Graph - Walk,Trail,Path | Discrete Mathematics by GP Sir

This video lecture on the "Eulerian Graph & Hamiltonian Graph - Walk, Trail, Path". This is helpful for the students of BSc, BTech, MSc and for competitive exams where Real Analysis is asked.

1. Definition of Graph and Basic Terminology Of Graph Theory
2. What is Graph Theory
3. Concept of Graph Theory With Examples
4. What is Walk, Trail, Path and Circuit in Graph Theory
5. What is Eulerian Graph & Hamiltonian Graph
6. Types of Graph in Graph Theory
7. Difference between, Walk, Trail, Path and Circuit in Graph Theory
8. This is helpful For CSIR NET, IIT-JAM, GATE Exams, B.Sc, Engineering
9. This is Part Of Discrete Mathematics B Tech

#GraphTheory #TypesOfGraph #DiscreteMathematics #BTech #ShortTrick #Engineering #BSCMaths #GATE #IITJAM #CSIRNET

⬇️ ⬇️ ⬇️ ⬇️ ⬇️ ⬇️ ⬇️ ⬇️
⏱Time Stamp⏱
→0:00 - Introduction of video on Eulerian Graph & Hamiltonian Graph
→0:49 - What is Walk
→1:20 - Example on Walk
→3:02 - What is Trial
→3:56 - Example on Trial
→4:11 - What is Path
→4:28 - Example on Path
→5:17 - Eulerian Path
→6:06 - Eulerian Circuit
→6:58 - Eulerian Graph
→7:43 - Hamiltonian Path
→9:07 - Hamiltonian Circuit
→10:15 - Hamiltonian Graph
→10:52 - Q1 on Hamiltonian Circuit
→11:27 - Q2 on Hamiltonian Circuit
→13:01 - Q3 on Hamiltonian or Euler
→14:12 - Q4 on Hamiltonian or Euler
→16:05 - Question for the comment box
→16:08 - Conclusion of the video

➡️ This Playlist of Discrete Mathematics Will Consists of the following Videos :-
1) Discrete Mathematics Sets, Function & Relation.
2) Discrete Mathematics Hasse Diagram, Lattice & Combinations
3) Discrete Mathematics Propositioned Logic
4) Discrete Mathematics Finite State Machine
5) Discrete Mathematics Recurrence Relation & Generating Function
6) Discrete Mathematics Graph Theory

➡️ This Video is helpful for :-
1) Discrete Mathematics for bsc 3rd Year
2) Discrete Mathematics for bsc 2nd Year
3) Discrete Mathematics for bsc 1st Year
4) Discrete Mathematics for B.Sc. Engineering
5) Discrete Mathematics for B Tech 2nd Year

This Concept is very important in Engineering & Basic Science Students. This video is very useful for B.Sc./B.Tech & M.Sc./M.Tech. students also preparing for NET, GATE, and IIT-JAM Aspirants.

Do Like & Share this Video with your Friends. If you are watching for the first time then Subscribe to our Channel and stay updated for more videos around Mathematics

📚 Our Book Publications

🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹🔸🔹

💯 My Social Media Handles 💯


📚 Important Course Playlist 📚

📷 My Equipment & Gear 📷

📚 Following Topics Are Also Available 📚

Thanks For Watching My Video 🙏🏻
Like, Share & Subscribe 💯
Dr.Gajendra Purohit

[gajendrapurohit]

➡ Incase you missed previous Videos of Discrete Mathematics =

[anjaligautam]

Edge not repeated
Option B is correct answer
Thank you so much sir 👌👌🙏🙏🤗🔥

[AbhishekSharma-es]

i never sow maths teacher as you in such a short period of time you give a very much knowledge dhanyawad GURU ji

[Jaiho-jd]

Very good and easy to understand, dhanyawad aapka

[Paramgraphicx]

Examples are most important to understand easily to the Questions. Great Teaching.❤🙌👍

[snehabiswas]

thank you sir for teaching this topic . i have fully understood the concept .
answer to the last question is option no b - edge not repeated.

[debabandanpattnaik]

B. Edge not repeated
Thank You so much sir! Your Pedagogical Skills are 🔥🔥👍👍

[BakewithMawra]

I have a lot of confusion regarding Euler and Hamiltonian but now my concepts are clear thanku sir

[SSs-fsks]

Sir it's a blessing to us . That we have you

[My_self_Ujjwal]

Tomorrow our 4th sem exam on discrete math and I revise all the concepts with 2x speed🙂

[arhamashaikh]

YOUR VIDEOS ARE SOO HELPFULL, IT CLEARS ALL MY CONCEPT REGARDING DM. THANKS ALOT SIR LOVE FROM PAISTAN

[anandsharma]

Sir understood the concept thanks to you

Answer to last question: Edge not repeated

[dhruvtonemare]

sir all your dreams come true your spreading knowledge
😄!!!!

[ayushmendiratta]

sir you are amazing .
glad to have you on YT

[mindrelax]

thank you so much sir for such a helpful video

[jaykiranbagadi]

Thank❤ you is a small word for you SIR 🙏✨

[IshaGarg-we]

Answer (b) is correct - Edges not repeated ☺️☺️👍👍❤❤

[YTVINIT]

So in hamiltonian graph we check all the vertices should be connected
And in eulers graoh all edges should be covered up so therefore they are known as euler and hamiltonian graph 😊❤😅

[BakewithMawra]

I have a exam today and you made my day ❤️

[roshankhadka]

edge not repeated
option B

Thank you