Questions on Graph Theory | Discrete Maths | UGC NTA NET May/June 2021

[@aasiamashkoor7382]

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.

[@abhisekchowdhury8584]

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.

[@noumanbhai7442]

main concept is if degree of every vertex is even then it is euler graph thanks me later

[@diptamoy12]

Please tell tricks of knowing Hamiltonian graph easily

[@mayankkhandelwal0762]

@@diptamoy12 if each node is visit exactly once while traversing all vertices is known as hamiltonian graph

[@sayandas5587]

@@mayankkhandelwal0762 🙃

[@maniksethi9882]

​@@mayankkhandelwal0762shabaashhhh!!!!!!😂

[@priyasharmaPP]

App jese teacher bahot kam h ....man karta h apki saari vedios ek hi din dekh le ...bahot acha samjate h sir app

[@Gamechanger..601]

Sir this shirt complements u alot..🤗

[@bhawanabhatt4369]

Well explained
Hope my sir will ask this question tomorrow 😂🤣🥺

[@anubhavheer4449]

Did he?? I hope too. 🤧

[@sumananuragi5987]

Thanks sir you are very very best teacher.

[@sajansekhu8785]

Thnkk u so much my great sir....God bless u forever...🙏🙏🙏.....isi trah se sikhate rhiye ji....

[@vijayghanghas6901]

thank you sir🙂😛

[@ShaliniSingh-xc5rn]

Sir ans. Bta dijiye.. Correct answers of every question... Taki pata lag jaye kon kon se thik kiye humne

[@asifurrahman5436]

your are the best

[@riturawat77]

My one of the favourite notification 😊😊😊🤭🤭

[@tayyab.sheikh]

Sir! Can you please make a video on dual graph, I'm really confused about dual graph

[@pyarilife_jindgi]

Sir please make more videos on weighted graph and more topics of discrete mathematics

[@omamaanam2474]

yes please

[@harshitchauhan1615]

Helpful questions sir.👍👍👍👍

[@Anushakurnool]

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

[@ayushsharma8495]

5?

[@Ahmedzulfiqar.cuiatd]

Yes you are wrong the converse of Dirac Therom is not true there is a Hamiltonian graph that does not satisfy dirac Therom

[@kaivalyastoyscollection897]

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

[@Anushakurnool]

s sir..am coincide with ur explanation

[@Ahmedzulfiqar.cuiatd]

Dear, the converse of Dirac Therom is not true

[@niravsatani7453]

plz sir make videos on lattice

[@sreelakshmijayasankar1014]

Sir please explain the sublattice qn qnno4

[@GateSmashers]

today i will..stay tuned

[@neelamkumari1873]

I understand well...in ur lecture 👌

[@Nebula096]

sir weighted graph bhi cover krdo please

[@sungbymeforyou]

Very helpful 👍🏻

[@funfun1411]

Thnku sir your explanation are grt. And plz sir sb que. Ke ans. Bhi provide kijiye.

[@marjankhan9531]

Thank you so much sir
U r the best

[@puneetbhardwaj9011]

We also want tree Playlist also

[@dharabhatt8480]

Very nice explanation

[@chatrubhujamaharana2009]

Sir please video on euler path

[@tusharsahu8587]

Thank you so much sir.

[@harishk1211]

Best

[@fidagc7425]

For what kind of vertex open neighborhood and closed neighborhood are equal ? Please dear sir reply me.

[@mightyeagle4314]

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 ??

[@namitsharma3449]

Thanks sir g 👍

[@PratimaYadav-bg3ug]

Thanku sir🙏

[@sajansekhu8785]

thnkss ji...stay blessed ji..

[@logtectheworldoftechnologi3435]

Super Sir ... Excellent Demo

[@rahulprashar5521]

sir please come up with descrete maths also

[@sratnamanjari244]

Thank you so much Sir... 😊

[@varshasingh2748]

Thank you sir

[@padamkanwar7912]

Sir mujhe nta net ke liye practice questions chhahiye kya aap provide Karwa denge sir if I join your Chanel .
Please reply sir

[@sachinkumar-us6wf]

upload a video on graph is
planner or not

[@ShaliniSingh-xc5rn]

Thank u sir

[@jaidattsingh4747]

Sir kaunse competitive exam ke liye ho sakta hai imp

[@veenugoyal8580]

Latice wala btaye sir

[@GateSmashers]

today i will..stay tuned

[@anupam96786]

again... another awesome video ❤

[@bohemia6708]

Thanks bro

[@wanifirdoos1737]

Very Amazing Explanation.... Thanku Very Much

[@neelam1391]

Sir other subjects ki bhi preparation kra do D.E , data structure,c++,

[@CombineCSTheExtraStep]

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)

[@ayushsharma8495]

2 < 6/2 . What's the point

[@Ahmedzulfiqar.cuiatd]

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 😊😊

[@kaivalyastoyscollection897]

Thanks

[@israrqayyum7]

🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰

[@Padne_ki_Pulia1234]

Please provide questions pdf

[@GateSmashers]

In today's video you will get pdf link..stay tuned

[@chitchatchitra]

Do you give any classes ? Is there any way to contact you ?

[@Chandankumar-qw6hb]

thanks

[@ratnakantahanse2661]

Thank you sir ❤️❤️❤️❤️....

[@lavkushnema6971]

Thank you so much sir...

[@vinitasingh1117]

Thank You sir