Twinless articulation points and some related problems

12/26/2019
by   Raed Jaberi, et al.
0

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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/03/2020

b-articulation points and b-bridges in strongly biconnected directed graphs

A directed graph G=(V,E) is called strongly biconnected if G is strongly...
01/29/2021

Counting orientations of graphs with no strongly connected tournaments

Let S_k(n) be the maximum number of orientations of an n-vertex graph G ...
04/21/2021

QCSP on Reflexive Tournaments

We give a complexity dichotomy for the Quantified Constraint Satisfactio...
03/09/2018

Minimum T-Joins and Signed-Circuit Covering

Let G be a graph and T be a vertex subset of G with even cardinality. A ...
01/05/2018

Sparse highly connected spanning subgraphs in dense directed graphs

Mader (1985) proved that every strongly k-connected n-vertex digraph con...
09/17/2020

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms

We introduce and study two natural generalizations of the Connected Vert...
05/29/2020

Parameterized Complexity of Min-Power Asymmetric Connectivity

We investigate parameterized algorithms for the NP-hard problem Min-Powe...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.