New algorithm for finding minimum vertex cut set

The number of vertex-connectivity, is an element the least number of elements in a set of vertex, which makes a graph disconnected. Researches relate to the discovery of the number of vertex-connectivity. In this paper, an algorithm that provides to find elements of Vertex-Cut Set is proposed. Complexity analysis of the algorithm is performed, and the trials are shared about written program. © 2012 IEEE