if some one gaining a knowledge from these videos .u people should pay back by giving likes , its your responsibility and loyalty to yourself . We must appreciate the effort he is making.
Chromatic No finding method is known as Welsh-Powell's algorithm. Step1: Arrange vertex in decreasing order Step2: Assign a colour to the vertices so that no 2 adjacent vertices have the same colour.
Sir please clear confusion, in euler graph degree of each vertices should be even, and about Hamilton degree of each vertices should greater than n/2(n is total no of vertex) so the answer is a , please tell me where I wrong, please correct me
sir in second question is : It is not hamilton graph. bcz each and every vertex atleast having n/2=6/2=3 degree. but in vertex 6 having two degree only.. so it is not hamilton graph.. if am wrong..kindly correct me sir
The converse of Dirac Therom is not true i.e if a graph satisfy dirac Therom it must be Hamiltonian .. but there is a Hamiltonian graph that does not satisfy dirac Therom .. the condition is necessary not sufficient 😊😊
if some one gaining a knowledge from these videos .u people should pay back by giving likes , its your responsibility and loyalty to yourself . We must appreciate the effort he is making.
Chromatic No finding method is known as Welsh-Powell's algorithm.
Step1: Arrange vertex in decreasing order
Step2: Assign a colour to the vertices so that no 2 adjacent vertices have the same colour.
App jese teacher bahot kam h ....man karta h apki saari vedios ek hi din dekh le ...bahot acha samjate h sir app
main concept is if degree of every vertex is even then it is euler graph thanks me later
Please tell tricks of knowing Hamiltonian graph easily
@@diptamoy12 if each node is visit exactly once while traversing all vertices is known as hamiltonian graph
@@mayankkhandelwal0762 🙃
@@mayankkhandelwal0762shabaashhhh!!!!!!😂
Sir this shirt complements u alot..🤗
Well explained
Hope my sir will ask this question tomorrow 😂🤣🥺
Did he?? I hope too. 🤧
Thnkk u so much my great sir....God bless u forever...🙏🙏🙏.....isi trah se sikhate rhiye ji....
My one of the favourite notification 😊😊😊🤭🤭
Thanks sir you are very very best teacher.
Helpful questions sir.👍👍👍👍
Sir please clear confusion, in euler graph degree of each vertices should be even, and about Hamilton degree of each vertices should greater than n/2(n is total no of vertex) so the answer is a , please tell me where I wrong, please correct me
s sir..am coincide with ur explanation
Dear, the converse of Dirac Therom is not true
Sir please make more videos on weighted graph and more topics of discrete mathematics
yes please
I understand well...in ur lecture 👌
Sir Hamilton me apne kah koi bhi vertex repeat nhi karna but apne 1 se start kia 1,2,3,6,4,5, or 1 pe end kia 1 to repeat hogya ??
For what kind of vertex open neighborhood and closed neighborhood are equal ? Please dear sir reply me.
sir in second question is :
It is not hamilton graph.
bcz each and every vertex atleast having n/2=6/2=3 degree.
but in vertex 6 having two degree only..
so it is not hamilton graph..
if am wrong..kindly correct me sir
5?
Yes you are wrong the converse of Dirac Therom is not true there is a Hamiltonian graph that does not satisfy dirac Therom
Thnku sir your explanation are grt. And plz sir sb que. Ke ans. Bhi provide kijiye.
Sir! Can you please make a video on dual graph, I'm really confused about dual graph
We also want tree Playlist also
Sir ans. Bta dijiye.. Correct answers of every question... Taki pata lag jaye kon kon se thik kiye humne
Very helpful 👍🏻
plz sir make videos on lattice
Thank you so much sir
U r the best
thnkss ji...stay blessed ji..
Sir please explain the sublattice qn qnno4
today i will..stay tuned
your are the best
again... another awesome video ❤
Doubt: For Euler we also check all vertices with degree even, so its satisfy this rule.
Hamiltonian Dirac's theorem apply kiya then deg(v)
2 < 6/2 . What's the point
The converse of Dirac Therom is not true i.e if a graph satisfy dirac Therom it must be Hamiltonian .. but there is a Hamiltonian graph that does not satisfy dirac Therom .. the condition is necessary not sufficient 😊😊
sir weighted graph bhi cover krdo please
Sir please video on euler path
Super Sir ... Excellent Demo
Very Amazing Explanation.... Thanku Very Much
thank you sir🙂😛
Sir mujhe nta net ke liye practice questions chhahiye kya aap provide Karwa denge sir if I join your Chanel .
Please reply sir
Very nice explanation
Thank you so much Sir... 😊
sir please come up with descrete maths also
Sir kaunse competitive exam ke liye ho sakta hai imp
Thank you so much sir.
upload a video on graph is
planner or not
Best
Thank you sir ❤️❤️❤️❤️....
Sir other subjects ki bhi preparation kra do D.E , data structure,c++,
Latice wala btaye sir
today i will..stay tuned
Thank you sir
Thanks sir g 👍
thanks
Thanku sir🙏
Thank u sir
Thanks bro
Please provide questions pdf
In today's video you will get pdf link..stay tuned
Do you give any classes ? Is there any way to contact you ?
🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰
Thanks
Thank you so much sir...
Thank You sir