* 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.
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.
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.
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
* 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..
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 ❤️❤️❤️
🙏🙏
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
Sir you are the best 😍😇🤗because of you I learn lots of things....your teaching method is superb👍👍👍👍👍
arey sir aap toh hero hai ek 6 min video me pura samjha dala thanks a lot
Most understandable language used. Best lecture delivery ..
oky bhai thara bhai jogindar
very nice and the most easiast way that I learnd from you to understand Euler Graph
Thanks a lot
Best video on Euler Graph so far.
Bruh kabhi socha nahi tha bachpan mei book ke last page pe khelne vala game kabhi syllabus mei bhi aayega 🙂
Thank you sir g... Kal paper Mera... Ap bhht axha smjhty .... Love from Pakistan..
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?
you are one of the best teacher 😊
Waah bhai kya samjaya he ekdam easy language... 👌👌
Bohat easily aur simple and short way mein bht achha smjate ho sir aap❤
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.
great teacher ever
Sir g kamaal hi krdiya apne ❤
sir, i studied in uni but jo ap ka is lecture ki samaj ayi who .level ha ap ka outstanding
Jo concept collage vali ma'am ne smjane me 4-6 din liye use less than 10min me smja diya 💎💥
Sirr aapne hum sab bachhon ke number bana diye!!! Thank you sir 🙏 😊
Great 👍
Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏
Love from Pakistan.I appreciate you and your mother .may allah give all happiness in your life that you want
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.
Thank you so much love from Bangladesh
Sir AP ppr sa aik din pehla bohat kaam ata ho apka concept ♥️from🇵🇰
So sweet sir ❤ thanks 😊 for very good teaching
even i know little urdu still i can understand alot. more simplicity thanks my G ...🤘
Thank you so much Sir... Aisehi Hamiltonian graph ka bhi Vedio banao Sir
Yes sir
yes sir
Thank you so much sir❤️🤗 you are the best.
Mera kl paper h jitna smj aaya h nah I hope ma phle dekh leta.
Great teacher loved it
Thanks so much respectful Sir love you from Pakistan
Thank you paaji yrr pass krwaata tuc✨✨
Thank you so much sir ❣️ For you simplest explaination.
Best explanation ever 👍
you are a great person .😊
Mera 3 ghnty baad ppr hy and mujy iss ka itna sa bi ni pata tha thankksssssss
1:30hr baad mera exam hai thankyou sir🥰
Thank you sir ✨
Subah mera exam hein thanks mann
Allah apka vala kare🤲
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.
Very helpful thanks sir ...
Thanks for covering my whole syllables in few minutes 😂🤝🏻
sir great appreciation for you👍
Great teacher😊
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
Thank you very much sir 😊
Very helpful vedio❤
sir your doing great job ones again thx sir i am vary grate full
thank you sir ❤❤❤❤
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
SO GREAT EXPLANATION THANK YOU
I need to study this language bro cause I know you're an expert in this domain and I want to learn
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...
I have a little doubt that in euler path vertex can be repeated or not ?
yes, vertex can be repeated
Paper k 1 Hr pahle dakh raha ho sub bhul gaya 😂
Sir aap bhagwaan ho 🙏🏻
🤣🤣🤣
Thanks for the video !
Nice explanation
Your vedios are so helpful tqsm sir.. i would like to say that please make a vedio on concept of line graph.thank you.
Nice 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?
Good lecture
Great way❤
Thank you sirr bhot asha smjya hai
Sir please make more videos on graph theory like ring sum of cut-sers etc.
Free m kya kya chahiye mam😅
Thank you for your help
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
Thanks alot sir 🙏
Thank You So Much
awesome video boss
thankyou
very helpful
Thankyou sir
I love u bro✨💖
So we can say that Every Euler circuit is Euler path but the converse is not always true right?
Sir path me to vertex repeat nahi honi chahiye na... To fir 2nd vala graph kaise Euler graph hua...
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.
❤❤❤
Thank you sir
Thanku so much sir
jo e hai second example me wo 2 baar visit ho raha hai kya wo sahi hai?
Thank you so much
Aj Mera paper ha or aj Dekhi vedio thank you so much sir
I am from Pakistan 😊
Lets say Apaha... 🙌🙌💥
Thanks bro
Please make vedio on recurrence relation sir
did he make?
Please upload vidios on tree of Mathematics🙏
Varsity life ka akheri xm hai kaal🙂 puri 4saal aap logh bachaliye! Thanks guys
Respect♥️
But sir isme "e" 2time aa raha h , aur path ka rule h na starting point hi 2 bar aa sake aur koi vertex nai 😭
Nice
Euler theorem and Euler graph different aa sir plz confirm it
Bhayaa ish graph may path condition source and destination same aiyya hey na..path hesha nahi hotha na bhayaa.plz explain?
Nice presentation . Still in path, vertices are not allowed to repeated. But your figure is against the definition .
Love from Pakistan Lahore
Sir how we find length of Eulerian trail in k5
That (AAPA) 😂
Sir g jini marzi koshish karlo maa boli niklni hi aw muho ❤️
Sir! Can you please make a video on dual graph, I'm really confused about dual graph
Mera aaj paper ha thanks Bhai 🔥