^{1}

^{*}

^{1}

^{1}

^{1}

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
^{2}) time algorithm to solve connectivity problem on circular trapezoid graphs.

The vertex connectivity κ ( G ) of a graph G is the minimum number of nodes whose deletion disconnects it. The computation of κ ( G ) for a given graph G is known as the vertex connectivity (vertex connectivity) problem, and it is one of the most fundamental problems in graph theory. In recent years, many studies related to vertex connectivity have been conducted [

Lin introduced circular trapezoid graphs (CTG), which constitute a proper superclass of trapezoid graphs and circular-arc graphs [

The rest of this paper is organized as follows. Section 2 describes some definitions of circle trapezoid graphs and models and introduces the extended circle trapezoid model, as well as some notations. Section 3 presents some properties on circle trapezoid graphs, which are useful for finding vertex connectivity in an efficient manner. Section 4 describes our algorithm for the VC problem and its complexity. Finally, Section 5 concludes the paper.

We describe the circular trapezoid model (CTM) before defining the CTG. The model comprises inner and outer circles C_{1} and C_{2} with radii r 1 < r 2 , respectively. Each circle is arranged counterclockwise with consecutive integer values 1,2, ⋯ ,2 n , where n is the number of trapezoids. Consider the two arcs, A_{1} and A_{2}, on C_{1} and C_{2}, respectively. Points a and b are the first points encountered when traversing the arc A_{1} counterclockwise and clockwise, respectively; similarly, points c and d are the first points encountered when traversing the arc A_{2} counterclockwise and clockwise, respectively. A trapezoid is the region in circles C_{1} and C_{2} that lies between two non-crossing chords ac and bd. A trapezoid C T i

is defined by four corner points [ a i , b i , c i , d i ] . Without loss of generality, we assume that each trapezoid has four distinct corner points. Each trapezoid C T i is numbered in ascending order according to their corner point a i , i.e., i < j if a i < a j . The geometric representation described above is the CTM.

illustrates an example of a CTM M having 8 trapezoids. For example, CTM is used for cities comprising cityscapes that spread radially around facilities such as stations and rotaries. It is used to visually represent the relationships among communities (linkage of transportation networks, sharing of infrastructure facilities, etc.), and it is applied to the optimization of city planning and facility arrangement.

i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
---|---|---|---|---|---|---|---|---|

a i | 1 | 3 | 5 | 7 | 8 | 11 | 13 | 15 |

b i | 4 | 6 | 9 | 10 | 12 | 14 | 2 | 16 |

c i | 16 | 7 | 6 | 3 | 12 | 8 | 15 | 13 |

d i | 4 | 11 | 9 | 5 | 14 | 10 | 1 | 2 |

A graph G is a CTG if it can be represented by the following CTM M: each vertex of the graph corresponds to a trapezoid, and two vertices in G are considered adjacent if and only if their corresponding trapezoids intersect.

In the following, we introduce an extended circular trapezoid model (ECTM) constructed from a CTM. Let n be the number of trapezoids in CTM M. Consider a fictitious line p that connects the points placed between 1 and 2n of C_{1} and C_{2}. First, we cut CTM along fictitious line p and expand the two circles C_{1} and C_{2} into parallel horizontal lines called top and bottom channels, respectively.

Hereafter, to avoid confusion, we denote trapezoids in CTM and ECTM by C T i and T i , respectively. Finally, for each T i , 1 ≤ i ≤ n , copies of T i + n and T i − n are created by shifting 2n to the right and left, respectively. An ECTM is constructed from a CTM by the above process, which can be executed in O ( n ) time [

Some notations that form the basis of our algorithm in Section 4 are defined as follows. A separating set in a connected graph G is a set of vertices whose deletion disconnects G. We introduce a new concept to ECTM that is similar to the separating set in CTG. A separating trapezoid set in an ECTM EM is a set of trapezoids whose deletion separates EM into two or more components. Let S be a separating trapezoid set of EM. E M − S is a trapezoid set that is obtained by deleting S from all trapezoid sets of EM. If E M − S has k components, we denote n c ( E M − S ) = k . Moreover, let G [ E M − S ] be a induced subgraph of G by the trapezoid set E M − S .

We describe some lemmas that are useful for constructing the algorithm for the VC problem.

Lemma 1. [

Lemma 2. [

Lemma 3. [

i | −7 | −6 | −5 | −4 | −3 | −2 | −1 | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|

a i | −15 | −13 | −11 | −9 | −8 | −5 | −3 | −1 | 1 | 3 | 5 | 7 | 8 | 11 | 13 | 15 | 17 | 19 | 21 | 23 | 24 | 27 | 29 | 31 |

b i | −12 | −10 | −7 | −6 | −4 | −2 | −14 | 0 | 4 | 6 | 9 | 10 | 12 | 14 | 2 | 16 | 20 | 22 | 25 | 26 | 28 | 30 | 18 | 32 |

c i | 0 | −9 | −10 | −13 | −4 | −8 | −1 | −3 | 16 | 7 | 6 | 3 | 12 | 8 | 15 | 13 | 32 | 23 | 22 | 19 | 28 | 24 | 31 | 29 |

d i | −12 | −5 | −7 | −11 | −2 | −6 | −15 | −14 | 4 | 11 | 9 | 5 | 14 | 10 | 1 | 2 | 20 | 27 | 25 | 21 | 30 | 26 | 17 | 18 |

Lemma 4. [

Lemma 5. Let G be a CTG G corresponding to an ECTM EM and let S be a separating trapezoid set of EM. Then, a CTG G [ E M − S ] is connected if n c ( E M − S ) = 2 . Furthermore, a CTG G [ E M − S ] is disconnected if n c ( E M − S ) ≥ 3 .

(Proof) If EM consists of one component, it is obvious that G is connected. We consider the case when n c ( E M − S ) = 2 , i.e., EM consists of two components. Assume that EM is divided into two components C_{i} and C_{j}, and vertices v i and v j ( i < j ) are in C_{i} and C_{j}, respectively. A trapezoid that intersects a fictitious line p is called a feedback trapezoid, where p connects the points placed between 1 and 2n of C_{1} and C_{2} in CTM M. No path exists from v i to v j through v k for v i , v k , v j ( i < k < j ) since EM is divided into two components C_{i} and C_{j}. However, some paths exist from v i to v j through some feedback trapezoids. Thus, in the case where EM consists of two components, G is connected. In the case where EM consists of three or more components, no path exists from v i to v j through or even through feedback trapezoids. This implies that CTG G corresponding to CTM M is disconnected.

Efficient algorithms that address various problems concerning non-circular intersection graphs (interval, permutation, trapezoid, etc.) have been developed. However, in general, problems for circular intersection graphs tend to be more difficult than those for non-circular intersection graphs. One cause is because, in contrast to non-circular intersection graphs, we cannot determine the starting position of an algorithm uniquely for a circular intersection graph owing to the existence of feedback elements. For several problems, we can develop circular versions of the existing algorithms by constructing extended intersection models for the problems. By using extended intersection models such as an ECTM, we can determine the start position of an algorithm uniquely and apply the algorithms of the non-circular versions partially. For instance, this method has been applied to develop efficient algorithms for the shortest path query problem [

Here, we concisely describe the outline of our algorithm. When a given CTG has articulation vertices, the vertex connectivity is 1. We can find articulation vertices in O ( n + m ) time by applying the traditional method with depth first search. Then, we discuss graphs that do not contain articulation vertices.

First, we construct an ECTM EM from a given CTM M by using Honma et al.’s algorithm [_{i} exists such that n c ( E M − S i ) ≥ 3, S i ∈ F S , the size of S_{i} is the vertex connectivity of CTG G, by Lemma 5. By Lemma 4, for each S i ∈ F S , n c ( E M − S i ) can be computed in O ( n ) time by Honma et al.’s algorithm [

Conversely, we consider the case where multiple S i ,1 ≤ i ≤ m exist such that n c ( E M − S i ) = 2 . In this case, G [ E M − S i ] is a connected graph for every S_{i}, by Lemma 5. In this case, a CTM M − S i has a fictitious line connecting C_{1} and C_{2} that does not intersect any trapezoid in M − S i (

After this process, n c ( E M − S i − S ′ i ) ≥ 3 holds and G [ E M − S i − S ′ i ] is disconnected, by Lemma 5. We can obtain the vertex connectivity of G by min i = 1 m | S i ∪ S ′ i | . We formally describe Algorithm VC-CTG as follows. A CTM M is taken as an input. Our algorithm uses both Ilić’s and Honma et al.’s algorithms [

In this section, we present Algorithm VC-CTG to compute the vertex connectivity of a CTG G. We formally describe Algorithm VC-CTG as follows. A CTM M is taken as an input. Our algorithm uses both Ilić’s and Honma et al.’s algorithms [

Here, we analyze the complexity of Algorithm VC-CTG. In Step 1, we check whether given graph G has articulation vertices using the traditional algorithm. Moreover, we return that vertex connectivity is 2 when the minimum degree of vertices in G is 2. This step can be done in O ( n + m ) time. In Step 2, we construct an ECTM EM from a given CTM M as an input. This step can be performed in O ( n ) time by using Honma et al.’s algorithm [

Theorem 6. Algorithm VC-CTG computes the vertex connectivity of CTG in

In this study, we proposed Algorithm VC-CTG, which operates in

We express many thanks to anonymous referees for their valuable advices on the theory of our attacks and their helpful editorial comments. This work was partially supported by JSPS KAKENHI Grant Number 19K11834 and 17K00324.

The authors declare no conflicts of interest regarding the publication of this paper.

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. https://doi.org/10.4236/jamp.2019.711177