Eccentricity of Vertex

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/engineering-mathematics/graph-theory/trees-definitions-properties-eccentricity-diameter-radius-and-center/asset-eccentricity-of-vertex after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: 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
  9. Paper 2 | 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
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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
  13. Paper 2 | 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 Run Time Environment
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
  16. Paper 2 | 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 Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture focuses on key concepts in graph theory, specifically within the context of trees. The instructor begins by defining eccentricity, radius, diameter, and the center of a graph. He uses a hand-drawn graph to demonstrate how to calculate the eccentricity of various vertices by finding the maximum distance to any other node. The lecture progresses to defining the radius as the minimum eccentricity and the diameter as the maximum eccentricity. Finally, the instructor explains the concept of the center of a tree, noting that it consists of vertices with the minimum eccentricity and that a tree can have either one or two centers, illustrating this with a second, simpler tree diagram.

Chapters

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

    The instructor introduces the concept of eccentricity with on-screen text defining it as E(v) = max d(v, vi) for all vi in G. He applies this to a complex hand-drawn graph, starting with vertex 'a'. He determines the distance to the farthest vertex is 5, writing 'E(a) = 5' on the board. He then systematically calculates eccentricities for other peripheral vertices like 'k', 'j', 'm', 'f', and 'g', writing the value '5' next to each, indicating they are all at a maximum distance of 5 from the center. He also calculates values for internal nodes, writing '4' next to vertex 'i' and '1' next to vertex 'h', showing a range of eccentricity values across the graph.

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

    The lecture transitions to defining Radius (R), Diameter (D), and Center (C). The instructor writes 'R = 3', 'D = 5', and 'C = 3' on the board. He explains that the radius is the minimum eccentricity found in the graph, which is 3, while the diameter is the maximum eccentricity, which is 5. He identifies the vertices with the minimum eccentricity of 3 as the centers, circling vertices 'c' and 'd' on the main graph. He draws a smaller linear graph below with vertices 'a', 'b', 'c' and distances '2', '1', '2' to further illustrate the concept. He states the theorem that every tree has either one or two centers, emphasizing that 'c' and 'd' are the centers because they have the lowest eccentricity value.

  3. 5:00 – 5:30 05:00-05:30

    In the final segment, the instructor uses a second, simpler tree diagram to reinforce the concept of centers. This tree has vertices labeled 'a', 'b', 'c', 'd', 'e', 'f'. He circles vertices 'c' and 'd' in this diagram as well, explaining that these are the centers of this specific tree. He emphasizes that because there are two adjacent vertices with the minimum eccentricity, the tree has two centers. This visual aid helps clarify the rule that a tree can have one or two centers, providing a clear example of the two-center case.

The video provides a structured lesson on the structural properties of trees in graph theory. It begins with the foundational concept of eccentricity, defining it as the maximum distance from a vertex to any other vertex in the graph. Through a detailed example involving a complex hand-drawn graph, the instructor calculates eccentricities for multiple vertices, distinguishing between peripheral nodes with high eccentricity (like 'a' with value 5) and central nodes with low eccentricity (like 'c' and 'd' with value 3). This leads naturally to the definitions of radius (minimum eccentricity) and diameter (maximum eccentricity). The lesson culminates in identifying the 'center' of a tree, defined as the vertex or vertices with the minimum eccentricity. The instructor highlights the theorem that a tree always has either one or two centers, using both the complex graph and a simple tree diagram to demonstrate cases where two centers exist, specifically vertices 'c' and 'd' in both examples.

Loading lesson…