0 votes 0 votes Why is the vertex connectivity of a graph always less than or equal to its edge connectivity? Graph Theory graph-theory graph-connectivity + – raja11sep asked Jan 5, 2022 • recategorized Jul 7, 2022 by Lakshman Bhaiya raja11sep 495 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply palashbehra5 commented Jan 5, 2022 reply Follow Share https://cs.stackexchange.com/a/109401/141272 1 votes 1 votes raja11sep commented Jan 5, 2022 i edited by raja11sep Jan 5, 2022 reply Follow Share read this but not getting. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes A vertex can be corresponds to many edges. When we remove one vertex there is high probability that graph become disconnected . On other side a edge is only corresponds to two vertex , which has less probability of making graph disconnected . Onika answered Jan 5, 2022 Onika comment Share Follow See 1 comment See all 1 1 comment reply raja11sep commented Jan 5, 2022 reply Follow Share Thanks..but this is not proof..Can you prove it by contradiction. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes @raja11sep The vertex-connectivity of a graph is less than or equal to its edge-connectivity… That is, κ(G) ≤ λ(G).... Both are less than or equal to the minimum degree of the graph, since deleting all neighbors of a vertex of minimum degree will disconnect that vertex from the rest of the graph... 1. https://gateoverflow.in/26307/That-edge-connectivity-less-equal-minimum-degree-vertex-graph 2. https://en.wikipedia.org/wiki/Connectivity_(graph_theory) aaa 1 answered Jan 5, 2022 aaa 1 comment Share Follow See 1 comment See all 1 1 comment reply raja11sep commented Jan 5, 2022 reply Follow Share thanks 0 votes 0 votes Please log in or register to add a comment.
