Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs

by   Yiling Dong, et al.

Let D=(V,A) be a digraph of order n, S a subset of V of size k and 2≤ k≤ n. A strong subgraph H of D is called an S-strong subgraph if S⊆ V(H). A pair of S-strong subgraphs D_1 and D_2 are said to be arc-disjoint if A(D_1)∩ A(D_2)=∅. Let λ_S(D) be the maximum number of arc-disjoint S-strong subgraphs in D. The strong subgraph k-arc-connectivity is defined as λ_k(D)=min{λ_S(D)| S⊆ V(D), |S|=k}. The parameter λ_k(D) can be seen as a generalization of classical edge-connectivity of undirected graphs. In this paper, we first obtain a formula for the arc-connectivity of Cartesian product λ(G H) of two digraphs G and H generalizing a formula for edge-connectivity of Cartesian product of two undirected graphs obtained by Xu and Yang (2006). Then we study the strong subgraph 2-arc-connectivity of Cartesian product λ_2(G H) and prove that min{λ ( G ) | H | , λ ( H ) |G |,δ ^+ ( G )+ δ ^+ ( H ),δ ^- ( G )+ δ ^- ( H ) }≥λ_2(G H)≥λ_2(G)+λ_2(H)-1. The upper bound for λ_2(G H) is sharp and is a simple corollary of the formula for λ(G H). The lower bound for λ_2(G H) is either sharp or almost sharp i.e. differs by 1 from the sharp bound. We also obtain exact values for λ_2(G H), where G and H are digraphs from some digraph families.


page 1

page 2

page 3

page 4


Strong subgraph k-connectivity bounds

Let D=(V,A) be a digraph of order n, S a subset of V of size k and 2< k≤...

A lower bound on the saturation number, and graphs for which it is sharp

Let H be a fixed graph. We say that a graph G is H-saturated if it has n...

Extremality and Sharp Bounds for the k-edge-connectivity of Graphs

Boesch and Chen (SIAM J. Appl. Math., 1978) introduced the cut-version o...

Strong subgraph k-arc-connectivity

Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced a...

Strong Subgraph k-connectivity

Generalized connectivity introduced by Hager (1985) has been studied ext...

New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures

In this paper, we consider the question of computing sparse subgraphs fo...

Digraph Colouring and Arc-Connectivity

The dichromatic number χ⃗(D) of a digraph D is the minimum size of a par...

Please sign up or login with your details

Forgot password? Click here to reset