2-blocks in strongly biconnected directed graphs

07/19/2020
by   Raed Jaberi, et al.
0

A directed graph G=(V,E) is called strongly biconnected if G is strongly connected and the underlying graph of G is biconnected. A strongly biconnected component of a strongly connected graph G=(V,E) is a maximal vertex subset L⊆ V such that the induced subgraph on L is strongly biconnected. Let G=(V,E) be a strongly biconnected directed graph. A 2-edge-biconnected block in G is a maximal vertex subset U⊆ V such that for any two distict vertices v,w ∈ U and for each edge b∈ E, the vertices v,w are in the same strongly biconnected components of G∖{ b}. A 2-strong-biconnected block in G is a maximal vertex subset U⊆ V of size at least 2 such that for every pair of distinct vertices v,w∈ U and for every vertex z∈ V∖{ v,w }, the vertices v and w are in the same strongly biconnected component of G∖{ v,w }. In this paper we study 2-edge-biconnected blocks and 2-strong biconnected blocks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2019

2-edge-twinless blocks

Let G=(V,E)) be a directed graph. A 2-edge-twinless block in G is a maxi...
research
12/30/2019

Computing 2-twinless blocks

Let G=(V,E)) be a directed graph. A 2-twinless block in G is a maximal v...
research
02/15/2018

Strongly connected components-Algorithm for finding the strongly connected components of a graph

A directed graph G (V, E) is strongly connected if and only if, for a pa...
research
09/11/2023

Digraph Branchings and Matrix Determinants

We present a version of the matrix-tree theorem, which relates the deter...
research
07/08/2020

Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems

A directed graph G=(V,E) is twinless strongly connected if it contains a...
research
04/07/2023

Temporalizing digraphs via linear-size balanced bi-trees

In a directed graph D on vertex set v_1,… ,v_n, a forward arc is an arc ...
research
08/11/2023

Shared ancestry graphs and symbolic arboreal maps

A network N on a finite set X, |X|≥ 2, is a connected directed acyclic g...

Please sign up or login with your details

Forgot password? Click here to reset