sir ,i have an question , on hamiltonian circuit is not correct it is hamiltonian cycle , because you said sir circuit is closed and all edges ,and cycle is closed and all vertex not repeated ,
Sir, you have been a great help!!! I'm currently in my 3rd semester in B. Tech and I've watched all your topics in first and second semester and I am really glad that I got Back/KT in both of semesters. Love you a lot sir
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 😊❤😅
12:35 the answer is still not clear to me, because at this point more than one vertex is getting repeated then how it is a hamiltonian circuit. I'am confused.
sir at 10:05 if we start from vertex w in 2nd example of Hamilton circuit as you told that we can repeat starting and ending vertex then Hamilton path will be : wxywuvw and Hamilton circuit will also form as the loop is closed.
starting point and end point( mean its not repeating the point but only its meeting at end), while in ur case it meeting at mid and passes by that why its not hamiltonian graph
6:22 pe that graph has edges=18 & vertices=12 so edges>vertices so sir told eulerian circuit nhi ho sakta ..but it is eulerian circuit ....so this condition does not work ???
MAJOR DOUBT SIR : they all shoud be connected graphs but some vertices do not have edges at all like in hamilton graph example x,w doesn't have any edge
In connected graph every two vertices needs to be connected. They can have direct edge connecting them between them or they can bee reached via other vertices in the graph.
You just have to check the degree of vertices , if more than 2 vertices have odd degree than its not a euler circuit and if have two odd degree than it will have euler path
Sir, why are we saying eularian path is path because we know that path has no repetition of vertex.But,I saw you repeating vertices in a eular circuit?? Please sir reply me
➡ Incase you missed previous Videos of Discrete Mathematics =
Playlist of Discrete Mathematics - ruclips.net/p/PLU6SqdYcYsfJ27O0dvuMwafS3X8CecqUg
sir ,i have an question , on hamiltonian circuit is not correct it is hamiltonian cycle , because you said sir circuit is closed and all edges ,and cycle is closed and all vertex not repeated ,
am i correct sir?
i never sow maths teacher as you in such a short period of time you give a very much knowledge dhanyawad GURU ji
Sir, you have been a great help!!! I'm currently in my 3rd semester in B. Tech and I've watched all your topics in first and second semester and I am really glad that I got Back/KT in both of semesters. Love you a lot sir
Bro sarcasm hai kya
You got back and kt
😂😂
Edge not repeated
Option B is correct answer
Thank you so much sir 👌👌🙏🙏🤗🔥
7 crore (saat kaarodddddddddddddd) bilkul sahi jawab
par degA KAUN@@gamerzone7703
@@gamerzone7703 la dedo fir inke sath crore
Bhai tu bhi sir ke like 👍 ka wait kr rha hai.
Examples are most important to understand easily to the Questions. Great Teaching.❤🙌👍
B. Edge not repeated
Thank You so much sir! Your Pedagogical Skills are 🔥🔥👍👍
nice answer brother !
are you from odisha ??
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.
moti truck
@@Roxx1010 😂🫡
Sir understood the concept thanks to you
Answer to last question: Edge not repeated
Sir it's a blessing to us . That we have you
Tomorrow our 4th sem exam on discrete math and I revise all the concepts with 2x speed🙂
bro meri bhi kal h,,,,,,, or me to pahli baar pad rha hu
I have a lot of confusion regarding Euler and Hamiltonian but now my concepts are clear thanku sir
Very good and easy to understand, dhanyawad aapka
Sir you are great teacher 🙏🙏
sir you are amazing .
glad to have you on YT
sir all your dreams come true your spreading knowledge
😄!!!!
Shi hi bolte hai sir 🔥🔥12:15
YOUR VIDEOS ARE SOO HELPFULL, IT CLEARS ALL MY CONCEPT REGARDING DM. THANKS ALOT SIR LOVE FROM PAISTAN
💯
Very beautifully explained ❤
option B is correct answer, Edge is not repeated in a Eulerian Graph, understood Sir!!
Answer (b) is correct - Edges not repeated ☺️☺️👍👍❤❤
For eulirian graph use the characterization that each vertex must be of even degree. I can teach gt up to PhD degree.
Easy topic h isliye 😂, or dusra koi topic ka bat kr
Bruh at least spell it correctly at the first place na..
then go for phD ..
It's eulerian come on yarr clearly written on thumbnail and yet..
Lekin padhna hi ni phd ka to kyu padhayega bhai 😇
To fir is video me kaise aa tapke 🗿
1 ghnte bd exam h.. me ol mera dost milke ab krre hai graph theory ke saare topics cover .. thankyou sir..😍
Thank❤ you is a small word for you SIR 🙏✨
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 😊❤😅
thank you so much sir for such a helpful video
Thanks sir , 14 marks question were directly asked from this topic in my sem exam
Thank you so much sir ❤️🙏
Ans -B
I have a exam today and you made my day ❤️
Konsi University h bhai teri?
@🌝Alia ch. no lul
@@Khushisingh11158 sare university wale yahi se padh rhe bhai
Edges are not repeated in Euler Graph , so Correct option is (b).
opt B is correct ans. u are grat sir
lots of love from anantnag kashmir
5:17 here the eulerian path repeated vertex w ,so how could it be a path
edge not repeated
option B
Thank you sir......
Best explaination!!👍
Thank you sir bahut maza aya padhne m sb smjh aa gya❤❤
12:35 the answer is still not clear to me, because at this point more than one vertex is getting repeated then how it is a hamiltonian circuit. I'am confused.
Same problem
he done wrong
sir at 10:05 if we start from vertex w in 2nd example of Hamilton circuit as you told that we can repeat starting and ending vertex then Hamilton path will be : wxywuvw and Hamilton circuit will also form as the loop is closed.
starting point and end point( mean its not repeating the point but only its meeting at end), while in ur case it meeting at mid and passes by that why its not hamiltonian graph
Bahut best explain krte hai sir jee thanks sir
Sir Guru purnima ki aap ko shubhkamnaye 😊
option B edge not repeated😍thank you sir
You are the best tutor sir
B is right 🎉🎉🎉🎉🎉
11:44
Outstanding explained sir ❤️🤗
Agley machine gate mathematics ke liye buy hoga course aapka padhya bade hi ache se samj aata hai mujhe😂❤❤❤❤
Very helpful videos 👍👍👍, I like it
Which is True in Euler Graph
Option B - Edge Not Repeated
Thank you Sir. 👌👌
the answer of the last question is - option b(Edge not repeated)
thk u sir
Last questions answer is option-B
Option B is correct answer sir,
Edge not repeated.😊
Dhanyawad guruji❤
students? nope
Dr.Gajendra Purohit: sun, toh sun
thank you so much sir. you have been a god sent angel during my exams rn
thank you sir for this explanation
Answer :- option B (Edges not repeated)
Dhanyawad Guruji !!! 🙏
5:17 here the eulerian path repeated vertex w , so how it be a path
@@MuhammedHijas.V He is taking about WALK on that particular time , In walk and cycle Starting point can repeat !
@@MuhammedHijas.V Also In Euclidean path , Starting and ending vertex could be same
B option is correct 💯 Euler graph is not repeated edge 😊
6:21 never let Travis Scott listen to ur song sir
10:12 but if we start moving from w only which is our starting point then it will be Hamiltonian circuit or not
Than u sir 🙏🙏🙏 we are eagerly waiting for this..
6:22 pe that graph has edges=18 & vertices=12 so edges>vertices so sir told eulerian circuit nhi ho sakta ..but it is eulerian circuit ....so this condition does not work ???
MAJOR DOUBT SIR : they all shoud be connected graphs but some vertices do not have edges at all like in hamilton graph example x,w doesn't have any edge
yes even I have the same doubt , none of the examples which sir took were connected graphs😑😑😑😏😏😏😏😏😏
In connected graph every two vertices needs to be connected. They can have direct edge connecting them between them or they can bee reached via other vertices in the graph.
@@rachitmittal448 thank uh brother
Since graphs are not connected how can u take them as connected
At 0:01 sir be like Sunil Shetty(hlo guyssss)
Overall sir you are best teacher ever 💕
sir in eulerian path example the vertex w is repeated so how can it be a path?
5:52 sir the vertix w is repeating.... how it can be a path ? In path the vertices shouldn't be repeated
How can it be an eulerian path at 5:38, sir ? The vertex w is repeating and that vertex is not the starting vertex.
Kon kon bsc final ke paper ke liye dekh raha he 😅😅😅
Fy ke liye
Very nice sir 🙏 🙏 🙏
😮halo istudents😢😢 very casual sir 😊
09:58 agar w se start kre to ? phir to hammiltonian hojayega sir
Nahi tabhi bhi mid me w ek or baar repeat hoga
sir, whole cse 2nd year student of chandigarh university is watching your videos
5:17
7:43
Thanks dude
Sir option B is correct...😊
at 10:22 its not a connected graph so how come its a hamiltonian graph?
Connected means every vertix is Connected with egdes, no one is left without Connected at least onces
The true Euler graph where edge are not repeated and it is always closed
Thanku 😊
❤❤❤❤❤❤❤ thanks sir
15:52 Answer (B)
B is correct answer 🎉🎉🎉
Thank u sir❤
Option b thank you so much sir..
❤❤❤❤❤
Option B is correct ❤😊
Sir theme me guitar bdia h nind aa jati h😂😂
Watching on 1.5x to revise all concepts
Edges not repeated option b is correct 🔥🔥
sir the correct ans is "b" , thank you sir.
You just have to check the degree of vertices , if more than 2 vertices have odd degree than its not a euler circuit and if have two odd degree than it will have euler path
0:35 start
Nice Sir 😊
Edges not repeated ❤
option b is correct
Very Nice
10:36 2nd example is confusing bcz they traverse all the vetex without repitation please clear my doubt
Sir, why are we saying eularian path is path because we know that path has no repetition of vertex.But,I saw you repeating vertices in a eular circuit??
Please sir reply me
vetex repeat hoga chalega edge nai hona chaiye
@@sagarbhanushali9286 Bhai lekin definition mei non repetition of vertex likha. I think Eulerian Path should also satisfy condition of path.
13:04
THANKS A LOT SIR
❤❤❤
last question ans is b
means edge should not repeat for eulerian graph
Option-B
Edges not repeat
6:48 sir circuit to ek virtex se ek he har trasverse karta h, then ye first time I pe aakar terminate ho jayga
Option B 15:48
u r the diamond