cut edge(edge connectivity) is always <= min degree
cut edge(edge connectivity) = 3 // removing 3 edges from any vertex will disconnect the graph
I think cut edge 0
ans d)
https://math.stackexchange.com/questions/457159/cut-vertices-and-cut-edges-did-i-answer-these-correctly
@srestha
actually the intention of qsn was actually to ask cut set(group of edges) rather than cut edge(single edge)
Manu small example is Peterson graph 3 regular + 10 vertex here vertex and edge connectivity is 3
https://math.stackexchange.com/questions/2195657/what-is-the-edge-connectivity-and-vertex-connectivity-of-the-petersen-graph