If a graph contains exactly two vertices of odd degree then there will be euler path in graph. But you are saying that the number of odd degree vertices can be less than two , which is wrong.Any eular path start with one of the vertex having odd degree and ends with the other odd degree vertex..
In case anybody reads this now and is wondering, a graph with an odd number of odd degree vertices is not possible (i.e. 1 odd degree vertex is not possible). We cannot construct the graph in such a case and hence there won't be any talks of it being a Euler's Graph (since there is no graph constructed in the first place).
Thank you so much sir Your method of teaching is so simple and clear all the main and important points of this topic, New subscribers here from Punjab Pakistan 💞💚🙋
If we follow the concept that euler path has max 2 odd degree vertices than according to that ques 1 is not a euler path as vertices a, b, c are having odd degrees
@@techvids9824 odd no. m dgree raha to o Euler nhi hota...but cyclic ho skta h bcz non stop nodes hota h n...and sorry mistake ki thi us tym Mai and even no.k degree ko euler graph khte h😊
Ty kal k exam k liye ye part mera clear ho gya.... Nothing is wrong ..... I understood fully.
If a graph contains exactly two vertices of odd degree then there will be euler path in graph. But you are saying that the number of odd degree vertices can be less than two , which is wrong.Any eular path start with one of the vertex having odd degree and ends with the other odd degree vertex..
In case anybody reads this now and is wondering, a graph with an odd number of odd degree vertices is not possible (i.e. 1 odd degree vertex is not possible). We cannot construct the graph in such a case and hence there won't be any talks of it being a Euler's Graph (since there is no graph constructed in the first place).
sir in your example v1 is not visited then how it fulfill the conditions
A lot of thanks sir 🙏🏼
Awesome video air or bhi dilye discrete matnmatices sae related for eg boolean algebra, relation and functions trees ,set .Mathematical induction
Super explain sir
Then What is difference Between Hamiltonian circuit and Euler circuit.???
Best videos on RUclips but homogenous recurrence relation videos are less
Thank you so much sir
Your method of teaching is so simple and clear all the main and important points of this topic,
New subscribers here from Punjab Pakistan 💞💚🙋
Really i am impressed with your teaching!
Best explanation sir😍...very very helpful videos ...thankuu sir😊
Excellent explanation 😊👍
I listened it on 2.7x
btw thanks for the lecture
but sir v3 vertex is also repeated so how can you called its a euler circuit in example 4.
Sir ji , tusi great hoooo, brooo U nailed it....... GOD BLESS U.
super se upper teaching
Best lecture
Thank you
A grapgh is not connected graph then how it is euler graph(ex.-3) ?
Nice teaching..
Nice
Thnqq so much sir u r really amazing sir nd the way u teach nd present some facts about the Theorem or topic is really helpful 🔥🔥
Thanks a lot.
Nice sir
nice video sir thx for this
If we follow the concept that euler path has max 2 odd degree vertices than according to that ques 1 is not a euler path as vertices a, b, c are having odd degrees
In case of parrallel edges, how to find graph is euler or not????
I know this might seem vague, but what pen do you use?
Pen is
yoo dude was thinking the same haha
What is semi euler graph?
sir degree is incoming direction of vertex
Agr degree even ho tu Kia grapgh cyclic b ho ga kia
@@afreennaaz6449 but even degree Euler k lie hoti ha na phir kyn Ni Euler ho ga or cyclic kaise
@@techvids9824 odd no. m dgree raha to o Euler nhi hota...but cyclic ho skta h bcz non stop nodes hota h n...and sorry mistake ki thi us tym Mai and even no.k degree ko euler graph khte h😊
@@afreennaaz6449 thanx dear
@@techvids9824 wlc😊
@@afreennaaz6449 yra mj pata Ni graph theory kyn tough lgti
But defination of path can not repeat vertex except 1st and last
12:18 vertex V3 is repeated 2nd time !!!
Vertex can be repeated bro!!
@@AntoGamingYT okay
Sir is lecture ke bad se kuch kuch
Point me mistake hai
Thanks sir
please upload trees lecture asap
Bhai tere to concepts hi alag chl rhe h
Wrong explanation....कॉन्सेट क्लियर नही है आपका, example bhi galat solve kar rhe ho
Bhai Sahi kah rha he
It is not eiler
Oiler...English is the worst...change my mind
Your Consept is wrong
Qualification kya hai tumhari??
Sir plzz delete these video cause these are wrong concepts..
Wrong information ....
Teaching krna bnd kro 😠😠
You are giving wrong informations
Clear your concepts first then after teach
Thanks sir
Thank you sir