Author(s)

Hirotoshi Honma, Kento Nishimura, Yuto Tamori, Yoko Nakajima

National Institute of Technology, Kushiro College, Kushiro, Japan.

The vertex connectivity k(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 O(n²) time algorithm to solve connectivity problem on circular trapezoid graphs.

Algorithm Design, Connectivity Problem, Intersection Graphs, Circular Trapezoid Graphs

Honma, H. , Nishimura, K. , Tamori, Y. and Nakajima, Y. (2019) Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs. Journal of Applied Mathematics and Physics, 7, 2595-2602. doi: 10.4236/jamp.2019.711177.