Relation between the Connectivity and Minimum degree | @17matboy | தமிழில்

#connectivity #vertexconnectivity #edgeconnectivity #minimumdegree #delta #Delta #kappa #kattappa #trivial #trivialgraph #connected #disconnectedgraph #edges #vertices #mathematics #mathematicalinduction #hypothesis #cutvertex #cutedge #vertexcut #edgecut #cycle


Vertex connectivity is less than or equal to edge connectivity and which also less than or equal to the minimum degree of the graph

The vertex connectivity of a graph G is a the minimum number of the vertices whose removal results in a disconnected graph or trivial graph.

The edge connectivity of a graph G is a the minimum number of the edges whose removal results in a disconnected graph or trivial graph.

The complete graph cannot be disconnected by removing any number of vertices but the trivial graph results after removing p-1 vertices.




‪@17matboy‬