Vertex connectivity means minimum no of vertices remove such that graph will be disconnected.

Edge connectivity means minimum no of edges remove such that graph will be disconnected.

in graph(a) vertex connectivity=1(remove e vertex) & edge connectivity=1(remove d-e edge)

in graph(b) vertex connectivity=1 & edge connectivity=2

Edge connectivity means minimum no of edges remove such that graph will be disconnected.

in graph(a) vertex connectivity=1(remove e vertex) & edge connectivity=1(remove d-e edge)

in graph(b) vertex connectivity=1 & edge connectivity=2