Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.
Fun, engaging games to boost memory, math fluency, typing speed, and English skillsβperfect for learners of all ages.
This chapter covers various operations on graphs, including the definition and properties of subgraphs, induced subgraphs, and data structures for graph representation. Additionally, it discusses the concepts of graph isomorphism and connectivity, as well as critical vertices and edges in graphs. The chapter highlights the importance of these concepts in understanding the structural properties of graphs and their applications.
Enroll to start learning
Youβve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
References
ch48.pdfClass Notes
Memorization
What we have learnt
Final Test
Revision Tests
Term: Subgraph
Definition: A graph formed from a subset of the vertices and edges of another graph.
Term: Induced Subgraph
Definition: A subgraph formed by taking a subset of vertices and including all edges connecting pairs of vertices in that subset.
Term: Graph Isomorphism
Definition: A relation between two graphs that indicates they have the same structure; they can be transformed into each other via a bijection between their vertex sets.
Term: Connectivity
Definition: A property of a graph that indicates whether there exists a path between every pair of distinct vertices.
Term: Cut Vertex
Definition: A vertex whose removal increases the number of connected components in a graph.
Term: Cut Edge
Definition: An edge whose removal increases the number of connected components in a graph.