thank for excellence lecture sir,, your teaching is so nice and clear. i mean do understand it well properly... thank you so much sir... From Philippines
using this for the new IB math HL course. Thank you so much (i am doing the math application and interpretation HL course, so we have to do graph theory)
Plsss to answer us🥺 color the following graph according to the given colors:red,blue,green, yellow.(before coloring the graph, please read first the definition of the four color theorem)
you are nice bro...................really you can explain the the whole concept thank you..................my lovely lecturer i get in my life nice!!!!!!!!!!!!!!!!!!!! please make lecture 1 .Data structure and algorithms 2. computer organization 3.computer graphics and java programming language
In the second graph, 4->5->1->2->3->4 We are starting at 4 returning to 4 without edge repeating.This is Euler graph @vivekanand khyade or are you missing to say that every edge should be covered?
According to the path you constructed, the edge 2-4 is yet to be visited. But, an Euler Path must include ALL the edges visited in any order. If atleast one edge is still left, then the path you just constructed is a SIMPLE path and not an EULER path. Feel free to drop more queries.
i always watch ur video sir... ur explanation is so clear... love from indonesia
Seroisuly sir aap bhut achy se concept clear krty ho
I really did understand our lesson now.Thanks to you sir and God bless sir😇from Philippines.
Good explaination. Begiinner can understand your explaination easily
You are amazing at making complex explanations so simple and clear! Thanks Vivekanand ji!
Cristal clear explation sir. I like your teaching methodology
From egypt , You are the best real
More thanks for you 💜💜💜
Very clear sir ur videos are.
your teaching is one of the best sir !!! Thanks a lot from the bottom of my heart sir!!!
Lovely teaching .... Nice bro..... Awesome Explanation.....
Thank you very much sir,please take love from Bangladesh.
You are incredible. Thank you so much (this is my first time complementing a teacher 😅)
You are very good at this sir.. thank you
Thank you for breaking it down, so easy to follow you
Sir your exaplanation is so clear👍
thank for excellence lecture sir,, your teaching is so nice and clear. i mean do understand it well properly... thank you so much sir... From Philippines
4:15
Your videos are very helpful for us.... thank you sir... 🙏🙏😊😊
Very nice explanations
Subscribed bro
Your way of teaching awesome
Please be my professor, you do a fantastic job man, you just earned a subscriber!
Thanku sir, for this wonderful lecture.....Love from Bleeding Kashmir
using this for the new IB math HL course. Thank you so much (i am doing the math application and interpretation HL course, so we have to do graph theory)
just to tell about what is degree he said link in description. no. of incident edges on a vertex bol dete pur views subko chaheyea
Thank you 👍👍👍👍
Good topic eccentricity of the vertices i have learned 😊
Thank u ...good explanation sir
thnak you about best explanation
Thank you very much. Nice explanation. 👌🙌👍
Great explanation
Thank you!
Excellent
Nice tutorial
a graph with a vertex of degree 0 can be eular???? how? how can we connect to this vertex without an edge?
Thank u amazing
clear explanation thank you
About Ramsey no. Problem can u give videos
Plsss to answer us🥺 color the following graph according to the given colors:red,blue,green, yellow.(before coloring the graph, please read first the definition of the four color theorem)
Thankyou sir for this wonderful lacture
Very helpful, thank you!
you are nice bro...................really you can explain the the
whole concept thank you..................my lovely lecturer i get in
my life nice!!!!!!!!!!!!!!!!!!!!
please make lecture
1 .Data structure and algorithms
2. computer organization
3.computer graphics and java programming language
Please Suggest website Name Plz i prepare myself for PreSentation ❤👈
Thank you so much bro
Sir please make video on dijkstra algorithm for shortest path
Sir will u plz upload a video on fleurys algorithm in graph theorey
Thank you 😊 sir
Thank you... you helped me a lot ❤😍😍
Good work keep it up 👏👏
what about directed graphs? you have taken examples only for undirected graphs, is there any change?
Nice
Excellent lecture sir thank you
Excellent 👍
sir please explain planarity of gtaph
If u found any odd degree vertex then not Euler graph
thank you for the help sir
Thank you for lesson
Corona made him come back!!! Jokes apart, please upload videos daily. :) We love your channel.
Sir can the 2nd graph be sem euler when start from 1243156 and stops at vertex 6
Nice sir
Hi
Q) If G1 is r1-regular and G2 is r2-regular , G1+G2 is Euler circuits or not .
Explanation for Chinese postman problem
thanks
Lovely
nice sir
Please explain underlying simple graph sir
In the second graph, 4->5->1->2->3->4
We are starting at 4 returning to 4 without edge repeating.This is Euler graph @vivekanand khyade or are you missing to say that every edge should be covered?
According to the path you constructed, the edge 2-4 is yet to be visited. But, an Euler Path must include ALL the edges visited in any order. If atleast one edge is still left, then the path you just constructed is a SIMPLE path and not an EULER path.
Feel free to drop more queries.
Can’t we draw 2-5 in second example 3:15
Good explanation but since u r teaching so no need to put transition unless u r using multiple cameras...
5-1-3-2-4-5
In second example..there is no edge repeating....so it s Euler graph only
Thumbnail 🤷🏻♀️😅👌
Watch it in 2x speed ... thank me later... 😁
sir can you not speak in hindi
Plan explain tamil
Please change the intro, it's too cringy
Explain konigsberg poblem
In semi - eulerian vertice 1 also have 1 degree so total three vertice has odd degree.
Very well explained sirr
Excellent explanation!!
Best explanation ever TT