Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs - Journal of Applied Mathematics and Physics

JAMP > Vol.7 No.11, November 2019

Journal of Applied Mathematics and Physics

Volume 7, Issue 11 (November 2019)

ISSN Print: 2327-4352 ISSN Online: 2327-4379

Google-based Impact Factor: 0.70 Citations

Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs ()

HTML XML

Download as PDF (Size: 679KB) PP. 2595-2602

DOI: 10.4236/jamp.2019.711177 374 Downloads 1,020 Views Citations

Author(s)

Hirotoshi Honma, Kento Nishimura, Yuto Tamori, Yoko Nakajima

Affiliation(s)

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

ABSTRACT

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.

KEYWORDS

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

Share and Cite:

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.

Cited by