Data Structure: Unit IV : Multiway Search Trees and Graphs

Cut Vertex

Definition, Operations, Algorithm | Graphs | Data Structure

Definition: A vertex V is an undirected graph G is called a cut vertex iff removing it disconnects the graph.

Cut Vertex

Definition: A vertex V is an undirected graph G is called a cut vertex iff removing it disconnects the graph.

• The cut vertex is also called as articulation point.

• The following example represents the concept of cut vertex.

• On removing C we get the disconnected components as.

• The concept of vertex are useful for designing reliable networks.

Data Structure: Unit IV : Multiway Search Trees and Graphs : Tag: : Definition, Operations, Algorithm | Graphs | Data Structure - Cut Vertex


Data Structure: Unit IV : Multiway Search Trees and Graphs



Under Subject


Data Structure

CS3301 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation



Related Subjects


Discrete Mathematics

MA3354 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation


Digital Principles and Computer Organization

CS3351 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation


Foundation of Data Science

CS3352 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation


Data Structure

CS3301 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation


Object Oriented Programming

CS3391 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation