Connectivity
A graph is said to be connected if there is a path between every pair of vertex. A graph having disconnected vertices is said to be disconnected .
Following graph is a connected graph , because you can travel through any vertex to and vertex . There is path to travel every vertex of the graphs :
While the another given graph is disconnected , since there is no path to travel from vertex a to d . There should be some path to go there . Hence it is an example of disconnected Graph .
Cut Vertex
Cut vertices are those vertices , removing them will make the graph as disconnected . See the following image , if you remove the vertex e or c you will get a disconnected graph .
Cut Edge or Bridge
Cut edges are those edges , removing of them will give you a disconnected graph . See the following image , if you remove the edge (c , e) then you will get a disconnected graph .
Sources
My LinkedIn :- linkedin.com/in/my-pro-file
Topics You may Interested IN :
- Representation of Graph and Intro to it : https://medium.com/@mdcode2021/representation-and-introduction-of-graph-dfb232a1ae2e
- BST , Tree : https://medium.com/dev-genius/trees-binary-search-trees-and-traversal-ab63e192f3a7
- Heap and Prioriy Queue : https://medium.com/@mdcode2021/heap-and-priority-queue-fbd41333dc0d
- All About Doubly Linked List : https://medium.com/@mdcode2021/all-about-doubly-linked-list-30f0f08afb9c
- Merge Sort : https://medium.com/swlh/title-1692d9fb5ced
