Degree Sequence Problem

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/discrete-mathematics/graph-theory/minimum-and-maximum-degree-relationships-degree-constraints-and-havel-hakimi-theorem/asset-degree-sequence-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture introduces the Havel-Hakimi algorithm, a method in graph theory used to determine if a given sequence of non-negative integers is 'graphic,' meaning it can represent the degree sequence of a simple graph. The instructor defines key terms like 'degree sequence' and explains that the algorithm is recursive, published by Havel (1955) and Hakimi (1962). The core of the lecture involves solving multiple-choice questions to identify which degree sequences correspond to valid simple non-directed graphs. The instructor demonstrates the application of the Havel-Hakimi algorithm by reducing sequences step-by-step, checking for negative numbers (indicating impossibility) or reaching all zeros (indicating validity). He also uses basic graph theory principles, such as the Handshaking Lemma (sum of degrees must be even) and the constraint that the maximum degree in a simple graph with n vertices is n-1.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a slide presentation defining the Havel-Hakimi algorithm as a solution to the graph realization problem. The text explains that it answers whether a finite list of non-negative integers can form the degree sequence of a simple graph. The instructor defines 'degree sequence' as a list stating the number of neighbors for each vertex. He notes that a positive answer means the list is 'graphic.' He mentions the algorithm is recursive and was published by Havel (1955) and Hakimi (1962). He then introduces a multiple-choice question asking to identify a valid degree sequence for a simple non-directed graph, listing options 1, 2, and 3. He begins by drawing a graph with vertices a, b, c, d, e to illustrate degree assignments, writing down a sequence {2, 3, 2, 4, 1} to match the visual.

  2. 2:00 – 5:00 02:00-05:00

    The instructor systematically evaluates the first three options. He crosses out option 1 {2, 3, 3, 4, 4, 5}, likely because the sum of degrees is 21, which is odd and violates the Handshaking Lemma. For option 2 {2, 3, 4, 4, 5}, he circles the number 5 and draws a cross through it, explaining that in a simple graph with 5 vertices, the maximum possible degree is 4, making a degree of 5 impossible. He then analyzes option 3 {3, 3, 3, 1}. He writes down the sequence and applies the Havel-Hakimi algorithm: he removes the first '3' and subtracts 1 from the next three numbers, resulting in {2, 2, 0}. He continues the reduction, which leads to a negative number (-1), proving the sequence is not graphic. He crosses out option 3.

  3. 5:00 – 7:42 05:00-07:42

    The lecture continues with a new set of options: 4) {1, 3, 3, 4, 5, 6, 6}, 5) {2, 3, 3, 3, 3}, 6) {6, 6, 6, 6, 4, 3, 3, 0}, and 7) {6, 5, 5, 4, 3, 3, 2, 2, 2}. He quickly crosses out option 4. He places a checkmark next to option 5, identifying it as a valid graphic sequence. For option 6, he performs a detailed step-by-step reduction on the whiteboard. He writes the sequence 6, 6, 6, 4, 3, 3, 0 and reduces it iteratively, eventually reaching a state with negative numbers (0, -1, -1, 0), confirming it is not graphic. He crosses out option 6. Finally, he underlines option 7 {6, 5, 5, 4, 3, 3, 2, 2, 2} as the correct answer. He writes out a long reduction chain for this sequence, showing the numbers decreasing until they reach all zeros, demonstrating that a simple graph can indeed be constructed for this degree sequence.

The video provides a comprehensive tutorial on the Havel-Hakimi algorithm, moving from theoretical definitions to practical problem-solving. The instructor begins by clearly defining the algorithm's purpose: determining if a sequence of integers is 'graphic.' He emphasizes the recursive nature of the method and its historical context. The core of the lesson is a series of worked examples where the instructor evaluates multiple degree sequences. He demonstrates a hierarchy of checks: first, basic properties like the Handshaking Lemma (sum of degrees must be even) and the maximum degree constraint (n-1). When these basic checks pass or are insufficient, he applies the full Havel-Hakimi reduction process. The board work is detailed, showing the iterative removal of the largest degree and the subtraction of 1 from the subsequent degrees. This visual demonstration helps students understand how negative numbers indicate an impossible graph, while a sequence of zeros confirms a valid realization. The lesson concludes by validating specific sequences, reinforcing the algorithm's utility in graph theory.

Loading lesson…