Affiliation:
1. School of Mathematics and Statistics, Ningbo University, Ningbo 315211, China
Abstract
Let D=(V(D),A(D)) be a digraph of order n and let r∈S⊆V(D) with 2≤|S|≤n. A directed (S,r)-Steiner path (or an (S,r)-path for short) is a directed path P beginning at r such that S⊆V(P). Arc-disjoint between two (S,r)-paths is characterized by the absence of common arcs. Let λS,rp(D) be the maximum number of arc-disjoint (S,r)-paths in D. The directed path k-arc-connectivity of D is defined as λkp(D)=min{λS,rp(D)∣S⊆V(D),S=k,r∈S}. In this paper, we shall investigate the directed path 3-arc-connectivity of Cartesian product λ3p(G□H) and prove that if G and H are two digraphs such that δ0(G)≥4, δ0(H)≥4, and κ(G)≥2, κ(H)≥2, then λ3p(G□H)≥min2κ(G),2κ(H); moreover, this bound is sharp. We also obtain exact values for λ3p(G□H) for some digraph classes G and H, and most of these digraphs are symmetric.
Reference15 articles.
1. Bang-Jensen, J., and Gutin, G. (2009). Digraphs: Theory, Algorithms and Applications, Springer. [2nd ed.].
2. The Steiner tree packing problem in VLSI design;Grotschel;Math. Program.,1997
3. The internal Steiner tree problem: Hardness and approximations;Huang;J. Complex.,2013
4. Sherwani, N. (1999). Algorithms for VLSI Physical Design Automation, Kluwer Acad. Pub.. [3rd ed.].
5. Li, X., and Mao, Y. (2016). Generalized Connectivity of Graphs, Springer.