Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs

Abstract

The vertex connectivity () G κ of a graph G is the minimum number of nodes whose deletion disconnects it. Graph connectivity is one of the most fundamental problems in graph theory. In this paper, we designed an () 2 O n time algorithm to solve connectivity problem on circular trapezoid graphs.