Cuts and Connectivity

Posted: August 27th, 2021

Student’s Name

Instructor’s Name

Course

Date

Cuts and Connectivity

Holding onto a constant connection and transmission of an undisrupted communication network is critical, especially when there are minimal vertices or edges failures. Specifically, this is achievable via the use of an expensive communication link that has fewer advantages. Therefore, digraphs are relevant in achieving such kind of communication link as loops are unavailable. It is essential to know the number of deleted vertices that would sustain a disconnection of a graph regarding connectivity.

A separating set, also known as a vertex cut of a graph, is a set with vertex and graph subsets as essential components of connectivity. Therefore, the connectivity of a graph specially composes of the minimum size of a vertex set. Notably, a graph is regarded as connected to a vertex if its connectivity has at least a single vertex point. Therefore, except for a complete graph, a graph is considered to have a connection via a vertex if and only if its separating set has a size of the same vertex point. Thus, the theory supports the proposition that a graph having more than two vertices has single connectivity on the condition that it is connected to a cut vertex.

Harary’s proof of the determinable conditions that presumed a graph to have a vertex connection implies that deleting a series of edges cannot interfere with connectivity. The reason is that connectivity entirely depends on a cut vertex. The security of transmitters is guaranteed if the communications are not disrupted by the noise that may result from edge connectivity. Therefore, the deletion of edges is the most secure measure of ensuring almost minimum disconnection by deleting edges.