1,523 views
1 votes
1 votes

why is the edge connectivity less than or equal to minimal degree of the vertex , since if we remove the no of edges equal to the minimum degree then the graph will become disconnected so then why is it that we put a less than or equal to condition on edge connectivity ?

1 Answer

3 votes
3 votes
i dont know why u r confuse even though u already explained concept..

see Edge connectivity is minimum number of edges removed in order to disconnect a graph. now we have to delete minimum number of edges then try for those vertices which is associated with minimum number of edges i.e. degree of that vertex should be minimum.

 

Note : a bridge in graph results edge connectivity to 1, which is less than minimum degree of any vertex.

Related questions

0 votes
0 votes
0 answers
1
Malusi asked Jan 12
88 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...
0 votes
0 votes
3 answers
2
Purple asked Jan 30, 2016
780 views
The number of colors needed to edge color a simple graph with maximum degree Δ is?Is this there in portion?