b-articulation points and b-bridges in strongly biconnected directed graphs
share
A directed graph G=(V,E) is called strongly biconnected if G is strongly connected and the underlying graph of G is biconnected. This class of directed graphs was first introduced by Wu and Grumbach. Let G=(V,E) be a strongly biconnected directed graph. An edge e∈ E is a b-bridge if the subgraph G∖{ e} =(V,E∖{ e}) is not strongly biconnected. A vertex w∈ V is a b-articulation point if G∖{ w} is not strongly biconnected, where G∖{ w} is the subgraph obtained from G by removing w. In this paper we study b-articulation points and b-bridges.
READ FULL TEXT