# Twinless articulation points and some related problems

Let G=(V,E) be a twinless strongly connected graph. a vertex v∈ V is a twinless articulation point if the subrgraph obtained from G by removing the vertex v is not twinless strongly connected. An edge e∈ E is a twinless bridge if the subgraph obtained from G by deleting e is not twiless strongly connected graph. In this paper we study twinless articulation points and twinless bridges. We also study the problem of finding a minimum cardinality edge subset E_1⊆ E such that the subgraph (V,E_1) is twinless strongly connected. Moreover, we present an algorithm for computing the 2-vertex-twinless connected components of G.

READ FULL TEXT
Comments

There are no comments yet.