Комментарии:
Great sir ❤
ОтветитьSir apaka teaching style is extraordinary.
ОтветитьSir Nn ka degree sequence kiya ho ga,
Ответитьthank you sir
ОтветитьThank you so much sir ❤
Ответитьamazing guru
ОтветитьThank you so much sir
ОтветитьAur is part main last wali degree sequence valid Ho gi?
ОтветитьSir kya degree ya degree sequence hum directed graph ki b nikal sakty hain?
Aur graph main loop b Ho to us ki degree kya Ho gi
sir, please suggest some books on graph theory.
ОтветитьGreat🔥
ОтветитьThank you sir
Ответитьsir u are delivering great content for free in a very ease way,thank u for making dm subject easy and learnable.keep it up sir.
ОтветитьExcellent 👌
Ответитьsir one question: can we eliminate degree sequence 1 and 2 on the basis that it is not in 'non increasing' or 'non decreasing' order?
ОтветитьAwsome
Ответить7,6,5,4,4,2,2,1. Cannot satisfy this one.
ОтветитьHow draw k4,4 & C4 & W4 & K4 and so on upto Kn graphs
Ответитьbc tu hero hai
Ответитьhow many f adds
Ответитьthanks sir..you are the best
ОтветитьThanku for beautiful explanation ....
ОтветитьKmaal hai Sir Superb aaj aapne mind ko kuch jyada hi refresh kar diya
Thanks Superb Sanchit Sir
Aisa kaise ho skta hai
ОтветитьAwesome
ОтветитьThanks 🙏🙏🙏🙏🙏🙏
ОтветитьU r just amazing sir!!...luv u sir
ОтветитьSir..,can you plz give explanation on Chinese postman problem
ОтветитьNice
ОтветитьThanku sir it was very helpful 😇
ОтветитьTq sir ji
ОтветитьLove you sir 😘😘
ОтветитьAwesome teaching sir
ОтветитьPlanner graph Graph coloring
Ответить1. Odd degree of vertices or d(v) must be even in number.
2. If total number of vertices are n, then d(v) cannot be more than (n-1).
3. Total degree must be even.
4 If two or more vertices have maximum degree then one vertex cannot hold 1 degree.
supperrb
ОтветитьIt is necessary to draw a simple graph if it is asked to "draw a graph using given degree sequence"?
ОтветитьThanks sir but also upload software engineering as net point of view thanks again
Ответить👍👍👍🤘🤘🤘🤘👌👌👌👌
Ответитьnice
Ответитьthanks guru ji
Ответитьsir you are great .....amazing logic without taking help of hakimi theorem and just by logic
ОтветитьThank you sir ☺
ОтветитьSir graphical sequence srf simple graph me hote hai? Conplex me nhi hota?
ОтветитьThank you sir you are best.
ОтветитьMza a gya
Ответитьthanks sir
Ответить