* For connected graphs * Euler path - A walk which visits every edge exactly once. (start and end vertex may or maynot be same)( don't try to relate with the definition of a path ) Euler circuit - Euler path with same start and end vertex. Euler graph - If a Euler circuit exists in a graph then the graph is a Euler graph. 1-If a graph has only even degree vertices - Euler circuit exits; Euler path with different start and end vertex doesn't exist. 2-If a graph has exactly two odd degree vertices - only Euler path with different start and end vertex exists, the start and end vertex being the odd degree vertices. 3- In very other type of graph Euler path is not possible. Your welcome! Have a good day.
Hi Varun I would like to thank you for the way you teach us its a really amazing and easy way to remember and I need to know about the Hierholzer algorithm if you could explain in a short video would be much appreciate.
A graph has a elr circuit if and only if each of its vertices ave Even degree. Theorem of eula circuit graph has a eula path if it has exactly two vertices of odd degree.
love you sir you are great , tommorow is my exam and i was in tension that i have not cover some of the topics include euler graph and you made my work easy . Thank you so much . Love from Jaipur.
Please upload videos on Operations on Graph Specially Fusion operation it's a humble Request Sir! You are Doing a Great Work ! Love your Video Lectures Tysm & Lots of Love ❤🇵🇰
In defination of path it is mentioned that vertices cant be repeated but to cover all the edges we may have something repeat the vertices then how it is Euler Path ? Please help me to understand
mera kal paper hai bhai jaan thank you so much for the videos, you saved my life and money, love from Pakistan.
Kon si padai bhai
Pakistan mai paper ki kami h na shyd...😆
@@yuvrajsingh3032 aap pakistan se ho
Mera aaj exam hai
@@yogeshpathe6707 mera kl hai
Bhai yar tumne itna ache se bataya ki mere college ayr tution teacher dono ne nai bataya, hats off to u, u are god like ❤️❤️❤️
🙏🙏
* For connected graphs *
Euler path - A walk which visits every edge exactly once. (start and end vertex may or maynot be same)( don't try to relate with the definition of a path )
Euler circuit - Euler path with same start and end vertex.
Euler graph - If a Euler circuit exists in a graph then the graph is a Euler graph.
1-If a graph has only even degree vertices - Euler circuit exits; Euler path with different start and end vertex doesn't exist.
2-If a graph has exactly two odd degree vertices - only Euler path with different start and end vertex exists, the start and end vertex being the odd degree vertices.
3- In very other type of graph Euler path is not possible.
Your welcome!
Have a good day.
thanks a lot bro!!
@@aneeshkulkarni-xl1jp glad I could help.
bhaii please can I get your insta id
bhaii ek baat batao agrr ekk hi odd degre vertices hai toh kya vo euler path hoga
@@GATEWith_HARIS Nahi ho payega..kyuki odd degree vertices start and end vertices banenge.. toh ek aur odd degree vertex ki zarurat padegi..
arey sir aap toh hero hai ek 6 min video me pura samjha dala thanks a lot
Sir you are the best 😍😇🤗because of you I learn lots of things....your teaching method is superb👍👍👍👍👍
very nice and the most easiast way that I learnd from you to understand Euler Graph
Thanks a lot
Sirr aapne hum sab bachhon ke number bana diye!!! Thank you sir 🙏 😊
Most understandable language used. Best lecture delivery ..
oky bhai thara bhai jogindar
Best video on Euler Graph so far.
Hi Varun I would like to thank you for the way you teach us its a really amazing and easy way to remember and I need to know about the Hierholzer algorithm if you could explain in a short video would be much appreciate.
A graph has a elr circuit if and only if each of its vertices ave Even degree.
Theorem of eula circuit
graph has a eula path if it has exactly two vertices of odd degree.
thanks bro
Exactly yaa almost?
Thank you sir g... Kal paper Mera... Ap bhht axha smjhty .... Love from Pakistan..
you are one of the best teacher 😊
Waah bhai kya samjaya he ekdam easy language... 👌👌
sir, i studied in uni but jo ap ka is lecture ki samaj ayi who .level ha ap ka outstanding
Thank you so much Sir... Aisehi Hamiltonian graph ka bhi Vedio banao Sir
Yes sir
yes sir
So sweet sir ❤ thanks 😊 for very good teaching
love you sir you are great , tommorow is my exam and i was in tension that i have not cover some of the topics include euler graph and you made my work easy . Thank you so much .
Love from Jaipur.
great teacher ever
even i know little urdu still i can understand alot. more simplicity thanks my G ...🤘
Jo concept collage vali ma'am ne smjane me 4-6 din liye use less than 10min me smja diya 💎💥
Sir AP ppr sa aik din pehla bohat kaam ata ho apka concept ♥️from🇵🇰
sir your doing great job ones again thx sir i am vary grate full
Thanks so much respectful Sir love you from Pakistan
Love from Pakistan.I appreciate you and your mother .may allah give all happiness in your life that you want
Mera 3 ghnty baad ppr hy and mujy iss ka itna sa bi ni pata tha thankksssssss
Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏
Mera kl paper h jitna smj aaya h nah I hope ma phle dekh leta.
Great teacher loved it
Please upload videos on Operations on Graph Specially Fusion operation it's a humble Request Sir! You are Doing a Great Work ! Love your Video Lectures Tysm & Lots of Love ❤🇵🇰
Hello aap kahase ho
@@yogeshpathe6707 Pakistan
@@Ash_099 I love india💓
@@Ash_099 nice to meet you
Great 👍
Best explanation ever 👍
Thank you so much love from Bangladesh
Thank you so much sir❤️🤗 you are the best.
Thank you so much sir ❣️ For you simplest explaination.
Very helpful thanks sir ...
Subah mera exam hein thanks mann
Allah apka vala kare🤲
Bruh kabhi socha nahi tha bachpan mei book ke last page pe khelne vala game kabhi syllabus mei bhi aayega 🙂
Great teacher😊
Your vedios are so helpful tqsm sir.. i would like to say that please make a vedio on concept of line graph.thank you.
Thank you very much sir 😊
I need to study this language bro cause I know you're an expert in this domain and I want to learn
sir great appreciation for you👍
Thank you paaji yrr pass krwaata tuc✨✨
Thanks for covering my whole syllables in few minutes 😂🤝🏻
you are a great person .😊
Thank you sir ✨
Very helpful vedio❤
In path we can't repeat vertices and edges .but you have repeat vertices in second example
acc to definition of path each *edge * has to be visited only once it does not apply for vertices
Nice explanation
SO GREAT EXPLANATION THANK YOU
Thank you sooooooooooooooooooo much sir
Sir please make more videos on graph theory like ring sum of cut-sers etc.
Free m kya kya chahiye mam😅
Paper k 1 Hr pahle dakh raha ho sub bhul gaya 😂
thank you sir ❤❤❤❤
Good lecture
bro jahn tak mai sahi hun isme ek or point or add hoga wo ye euler mai vertex ki degree ( even ) honi chye tabhi ban skhta hai.
Sir aap bhagwaan ho 🙏🏻
🤣🤣🤣
Please make vedio on recurrence relation sir
did he make?
Aj Mera paper ha or aj Dekhi vedio thank you so much sir
I am from Pakistan 😊
Thank you sir
Thank you sirr bhot asha smjya hai
Thank You So Much
Great way❤
DOUBT
"An Euler cycle in a graph G is a
simple cycle that passes through
every edge of G only once."
but in
05:55 'e' vertex is visited TWICE
edit : i got it , because the only to be visited once rule was for edges not for vertices.
Nice Sir 😊
Thanks for the video !
Thank you for your help
awesome video boss
Please upload vidios on tree of Mathematics🙏
1:30hr baad mera exam hai thankyou sir🥰
very helpful
Thanks alot sir 🙏
Lkn jis mein euler circuit exist krta ha wo euler path to nhi ha because us mein edge mid wala repeat ho rha ha?
thankyou
Thankyou sir
Sir! Can you please make a video on dual graph, I'm really confused about dual graph
Thanks bro
Mera aaj paper ha thanks Bhai 🔥
Thanku so much sir
That (AAPA) 😂
Sir g jini marzi koshish karlo maa boli niklni hi aw muho ❤️
Thank you so much
I have a little doubt that in euler path vertex can be repeated or not ?
yes, vertex can be repeated
Bro you said repeatation of vertex is not allowed then how did you conder 2nd example as euler graph
In Euler path and Euler circuit m vertex repeat ho b skty hai r ni b but edge repeat ni ho ga...
Nice
In defination of path it is mentioned that vertices cant be repeated but to cover all the edges we may have something repeat the vertices then how it is Euler Path ? Please help me to understand
Sir path me to vertex repeat nahi honi chahiye na... To fir 2nd vala graph kaise Euler graph hua...
So we can say that Every Euler circuit is Euler path but the converse is not always true right?
Bhayaa ish graph may path condition source and destination same aiyya hey na..path hesha nahi hotha na bhayaa.plz explain?
You Have Dsgt exam on 23 November 🙂
😥
MU🤝🤝
Kuch samaj nahi arah hoga
Rahil?
@@kaisermomin9276 haa bhai main APSHAH se hoon
Love from Pakistan Lahore
I love u bro✨💖
Very nice
Lets say Apaha... 🙌🙌💥
Euler theorem and Euler graph different aa sir plz confirm it
Looking forward for requested vedio.Hope you will definitely help me.Tq.
Thanku sir
Sir how we find length of Eulerian trail in k5
Fy ❤️bcs 2 semester,Sir pepar pattern pe video banay or Kitana mark ka ho External exam please sir
jo e hai second example me wo 2 baar visit ho raha hai kya wo sahi hai?
Sir. Ugc net 2021 computer science ki paper analysis karo ek video me..