10- Degree Sequence of a Graph

📝 Please message us on WhatsApp: wa.me/91800012...
💻 KnowledgeGate Website: www.knowledgeg...
📲 KnowledgeGate Android App: tiny.cc/KG_Offi...
➡ Do not miss our Bestseller Courses:
🔴 GATE Guidance-2025: www.knowledgeg...
🟠 GATE Guidance-2026: www.knowledgeg...
➡ Contact Us:
🟩 Whatsapp Chat: wa.me/91859512...
📞Call on: [phone]
🟦 Telegram Updates: t.me/kg_gate
🟩 Whatsapp Updates: www.whatsapp.c...
📧 Email: [e-mail]
➡ Our One Shot Semester Exam Videos: 👇
▶ Operating System: • Complete Operating Sys...
▶ DBMS: • Complete DBMS Data Bas...
▶ Computer Network: • Complete CN Computer N...
▶ Digital Electronics: • Complete DE Digital El...
▶ Computer Architecture: • Complete COA Computer ...
▶ Data Structure: • Complete DS Data Struc...
▶ Algorithm: • Complete DAA Design an...
▶ Software Engineering: • Complete Software Engi...
▶ Theory of Computation: • Complete TOC Theory of...
▶ Compiler: • Complete CD Compiler D...
▶ Discrete Maths: • Complete DM Discrete M...
➡ Free Subject-Wise Complete PlayList: 👇
▶️ DBMS: tiny.cc/kg_yt_DBMS
▶️ Operating System: tiny.cc/kg_yt_OS
▶️ TOC|Automata: tiny.cc/kg_yt_toc
▶️ Computer Networks: tiny.cc/kg_yt_CN
▶️ Digital Electronics: tiny.cc/kg_yt_D...
▶️ Compiler Design: tiny.cc/kg_yt_C...
▶️ Computer Architecture: tiny.cc/kg_yt_COA
▶️ Data Structure: tiny.cc/kg_yt_D...
▶️ Algorithms: tiny.cc/kg_yt_A...
▶️ Set, Relation, Function: tiny.cc/kg_yt_D...
▶️ Graph Theory: tiny.cc/kg_yt_g...
▶️ Group Theory: tiny.cc/kg_yt_g...
▶️ Proposition: tiny.cc/kg_yt_p...
#knowledgegate #GATE #sanchitjain
*********************************************************

[@AdeshPaul]

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.

[@KeshariPiyush24]

in 4th one more appropriate to say "degree of any vertex cannot be less than no of vertices with maximum degrees".

[@technologypower9150]

Better quotation for the first point: The number of vertices having an odd degree must be even.

[@techbeta101]

Full video summarizer.❤❤🤗🤗

[@thecelebrity9708]

kya baat he,,superbbbb,,, aapko to Education System ka Prime Minister hona chahiye ... maja aa gaya @knowledge Gate

[@rishabhsharma667]

Agree bhai same comment kerne ja rha tha

[@nehapande1321]

Absolutely right

[@farhanrazaqadri_]

+1

[@achievers3775]

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.

[@Amit_Malik2221]

Kmaal hai Sir Superb aaj aapne mind ko kuch jyada hi refresh kar diya
Thanks Superb Sanchit Sir

[@MonikaKumari-qy3fn]

Sir aap trees ,recursion and recurrence relation par video upload kijiye please your all videoes are awesome and very helpful for me .please upload video on this topics mere software subject ke topics hai you tube koi hindi mai video hi nhi hai en topics par but mujhe aap ke samjhane ka tarika bahut best laga khass college mai bhi aap ke jaise teacher hote god bless you sir

[@pranavganorkar2379]

Great as always Sanchit sir ! Thanks for starting this series on Graph Theory...It is indeed one of the important topics in GATE Discrete Maths.

[@nikitamalhotra5072]

Very helpful study material. Thank u sir

[@lordstinson8095]

Amazing introduction to degree sequences and precursor to Havel Hakimi theorem! Thank you.

[@rashmikumaria-nitwane9085]

sir please upload more videos . you are great teacher. thank you Sir

[@freelearningwithasim3894]

Rule 1: check handshaking theorem or check number of odd degree
vertex will be even in counting.
Rule 2: maximum degree of one vertex will be n-1. We have seen it in
maximum number of edges possible for n vertices.
Rule 3: if a graph has n vertices. And n-1 vertices have degree n-1 then it is
not possible that last vertex has degree less than n-1.
Rule 4: if a graph has n vertices. And m(2) vertices have degree n-1(MAX)
then other vertices must contain degree at least m(2).

[@manassahoo2750]

Sir apaka teaching style is extraordinary.

[@KNOWLEDGEGATE_kg]

Thanks a lot for your valuable feedback ❤ Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊

[@anshulthakur3806]

Very helpful and explanatory :)

[@pravanjanmishra6542]

This is awesome.

[@AbhishekKumar-et6on]

please ... Graph coloring ka video upload kijiye .. and thanks for these informatic videos ..

[@anmolkhemuka2839]

sir you are great .....amazing logic without taking help of hakimi theorem and just by logic

[@manasatatikonda]

Sir..,can you plz give explanation on Chinese postman problem

[@ramshelke6645]

Sir....aap bohat achya padhate ho ..thanks sir ..

[@madhurthapliyal9841]

Thanku for beautiful explanation ....

[@raziaali663]

Thanq sir

[@OmitA25]

thank you so much sir for so much effort for us...

[@Yash-xd6zs]

Thank you so much sir ❤

[@KNOWLEDGEGATE_kg]

Most welcome dear😍 Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊

[@sairajdas6692]

Beautiful explanation Sir

[@ghayyasmubashir8835]

Yar yeh Banda Kamal he.. Iski vedios kafi helpful hain.. Love From Pakistan...

[@awalktoinfinity665]

Banda Bandi kya kar rha h.. izzat se baat bhi kr skta h kya..
Aise hi baat karte ho teacher se Apne terrorist country me kya ??
Apne garib country me kuch dhang ka padhai toh hota nhi h..chle aate h Indian teacher se padhne .. huh
Terrorist
Teri profile dekhi Abhi kholke aadhe se zda toh indian channel subscriptions le rkha h.. apni country me kch dhang ka bhi h kya ?? Aur inko Kashmir chahiye

[@ghayyasmubashir8835]

BIT e-platform Tmhare KhulBushan Bandr ko abhi pkra hena humne.. tb se sy tmse Jahil log pagal hoye pare ho Nawaz Shareef jese logo ko tm log paise dete thy take Pakistan toote. Or ab jab ISI ne is sb ko pkr lia tu ab tm log Direct Jang pe agye ho.. Besharmo Sharwm se doob maro salo.. Filmo me dekhate ho India bechara Baat cheet krna chahata he or Pakistan Baat krna hi nh chahta.. Or Yahan saley Pakistan Muhabaat ki bt kr rha he tu topi drama kr rhe ho.. Begerton kch tu shram krlo.. Kehte ho India me bht talent he. India yeh India wo... Aby agr itna he talent he tu ek washroom hi bana lo Jahalio.. Kahan he wo ameer tareen Indian log.. Google ka CeO, Microsoft ka Ceo.. Aby wo tmhari country me paise spend hi nh krte.. Baat kre ho unki.. Phly Washroom banawa lo.. Phir hume terrorist kehna.. 😂😂
Or rahi baat cricket ki.. Tu Knjr 180 yaad he???

[@awalktoinfinity665]

Bhai haar Gye ho Maan lo.. ab kch mila kehne Ko toh hmne ICC bhi khareed Liya h 😂😂 matlab kch bhi...
Aur agr hamare bowlers Ko bowling nhi aati toh bar bar match kyu haar jate ho... Kch krro na krro..bakwas dher sari krro bakrichodo.. Pakistan ka maa ka bhosda..
Ab chl Jaa aur gand mara aur bomb bna Jake..😂 aur ICC khareed bhi Liya h toh sale hmaari aukat h..tmhri toh utni bhi nai h..
Matlab kya logic Laga ke bola h ICC khareed Liya h😂😂 bakrichod

[@shubhampreetsingh8630]

Love from India, brother

[@saddamahmad2310]

Thank You very much sir for this video

[@aurnishabardewa2663]

Draw a graph with vertex set v={v1, v2, v3, v4, v5, v6} and such that d(v1) =2, d(v2) = 2 , d(v3) =4, d(v4)=1 and d(v5)=1.is there a tree with given vertex set v and given degree??
I would be greatfull if you could solve this ASAP..

[@sanjaysolanki5757]

Thanks...for make it so simple and logical

[@mangeshpetkar7204]

Awesome teaching sir

[@pushkarkumar7173]

Sir plz make videos of combinatorics

[@rahmanmana2777]

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

[@narendraparmar1631]

Thanks a lot sir ji
Many concepts cleared 😆

[@amanmaheshwari5665]

U r just amazing sir!!...luv u sir

[@Ankit-we8ym]

D wala example best tha sir,aise kabhi nhi socha

[@pushpanjalidabade7507]

Great🔥

[@KNOWLEDGEGATE_kg]

Thanks Pushpanjali..Keep watching !!

[@nehapande1321]

Thank you sir

[@KNOWLEDGEGATE_kg]

You're welcome Neha !!

[@sayedzulfiqarahmad9920]

This is amazing every lecture is very helpfull thank you Sir....

[@syedqasimhussain7799]

Excellent 👌

[@KNOWLEDGEGATE_kg]

Thank you !! Please review our app tiny.cc/yt_KgApp. Your review will help new audience to build trust on us 😃

[@MandeepKumar-ue3zy]

Awesome video 👌👌

[@csa5129]

thanks sir..you are the best

[@ananyaraj3073]

Thanku sir it was very helpful 😇

[@ShubhamGupta-xf6xi]

Thank you sir

[@priyanshu0122]

Tagda sir.
Maza aaa gaya

[@letsknow1922]

thanks guru ji

[@vikrantbharduaj1963]

amazing guru

[@KNOWLEDGEGATE_kg]

Thanks a lot dear Vikrant, keep learning & supporting !! Do visit our website www.knowledgegate.in for more courses & contents !!

[@sayangangopadhyay7318]

Great sir ❤

[@KNOWLEDGEGATE_kg]

Thanks dear @Sayan❤ Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍😊

[@arpitakundu1932]

sir, please suggest some books on graph theory.

[@KNOWLEDGEGATE_kg]

Hi Arpita.. Please go through this link th-cam.com/video/b97iOUX4mbc/w-d-xo.html
Sanchit sir has explained in detail the books required for preparing GATE exam. You will get suggestions for books on graph theory also.

[@jitjisahu5285]

Tq sir ji

[@anurag9110]

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?

[@codingblaze4611]

Thank you sir you are best.

[@rabiyashiragumpi480]

👌 explanation

[@shree2710]

sir, but the second degree sequence is neither in non-decreasing nor in non-increasing order, then what is the need for checking?

[@shriram6123]

Thanks 🙏🙏🙏🙏🙏🙏

[@RaviSingh-yf6jd]

Thanks sir but also upload software engineering as net point of view thanks again

[@satyendersharma221]

Thank u sir

[@epicclips8881]

Nice

[@maths5911]

Thanks sir

[@deebadafedar7152]

Helpful

[@nirbhaykumarchaubey8777]

U R great, sir!

[@KNOWLEDGEGATE_kg]

Thank you! Keep learning & supporting❤

[@mohanbhati9595]

thanks sir

[@jayrammadkami4503]

Thank you so much sir

[@KNOWLEDGEGATE_kg]

Most welcome Jayram.. keep learning and supporting !!

[@dheerajrayakwar5822]

sir please complete the Turing machine in TOC first

[@Chandankumar-qw6hb]

thank you sir

[@KNOWLEDGEGATE_kg]

You're welcome dear 😍Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊

[@ahmedshahzad4229]

nice

[@rishabhsharma667]

Awesome

[@rahmanmana2777]

Aur is part main last wali degree sequence valid Ho gi?

[@KINGKHAN-sb9ek]

How draw k4,4 & C4 & W4 & K4 and so on upto Kn graphs

[@starboy_jb]

Sir please make videos on hasse diagram in lattice

[@RaviSingh-yf6jd]

Planner graph Graph coloring

[@slingshot7602]

Awsome

[@ratnapriyaverma2814]

It is necessary to draw a simple graph if it is asked to "draw a graph using given degree sequence"?

[@RajKamal-zc7iy]

Yes

[@NaveenKumar-tn4xs]

thanku sir

[@parthjoshi499]

Thank you Sir!

[@mathematician5786]

Sir Nn ka degree sequence kiya ho ga,

[@akknive]

sir....quantifiers aap video uploaded krne wale the???

[@hirahira3205]

Plz pdf notes

[@Nick-ui9dr]

5:09 But agar puch liya toh?... I mean kitney simple graph ban saktey? ... I mean badiya problem hai... exam mein na bhi pucha wassey face kar li toh? Hai koi tarika I mean nikalney ka? Arey assey hi typical kaam karaoge toh dimaag khulega... energy milegi... No? Isshi liye toh aaye hai guru ji aap ke darbaar mein... warna thodi bahut toh hum apni desi style se bhi problems solve kar letey. Humne socha computer engineers ki bhudi se socha jaye problems ke baare mein. Ho sakta hai pahadey yaad karne se problem jaldi solve ho jaati ho. 😄

[@akknive]

guru g👌👌👌

[@kaustuvmandal47]

7,6,5,4,4,2,2,1. Cannot satisfy this one.

[@vivekojha4807]

C(odd)&1 Isliye satisfy nahi karega

[@rajanbaliwal998]

how many f adds

[@itsandy8782]

Sir graphical sequence srf simple graph me hote hai? Conplex me nhi hota?

[@ameersalman6097]

thebongfungirl degree sequences of a simple graph

[@deepakmathew5628]

supperrb

[@dgmusicsongs]

Mza a gya

[@parthjoshi499]

Sir, if any vertex of a graph has a self-loop too, will that loop increase the degree of that vertex by 1, or it's not considered at all, as the self-loop connects to no new vertex?

[@anshgyl]

A self loop increases the degree of a vertex by 2 in case of an undirected graph.
Every edge has two ends, hence the sum of vertex degrees is twice the total number of edges(Hand Shaking Theorem). This is a nice property to have, and saying that a self-loop increases the degree of its vertex by 2 preserves this property.

[@parthjoshi499]

Thanks Ansh!

[@Shinigami1209]

That's what I was going to mention

[@Nick-ui9dr]

4:06 Guru ji baaki sab theek hai but aapne yeh increseasing aur decreasing ke aage "non-" prefix ki jo chidiya bitha di ... iska kya raaz hai?... I mean sidhe increasing decreasing bhi bol saktey the. Yeh visesh kripa kyun hum garib pupils pe? Ab ek instruction bad gaya nahin decode karne ke liye? Yahan angreji ki wassey hi maar hai 😄 I mean discrete math ki proposition logic wali bimari? Kahin nahin saheb hum toh ultey hi kaan pakadenge. 😂

[@supriyasuman3815]

Do you have proper videos on process management in operating system?

[@sharkk2979]

Aisa kaise ho skta hai

[@skasedali5947]

Love you sir 😘😘

[@gauravmavani1413]

👍👍👍🤘🤘🤘🤘👌👌👌👌

[@learnCodingDeadEasy]

sir aap to superb hainjabardast teaching style hai aapka