Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs

12/20/2018
by   Yuefang Sun, et al.
0

A digraph D=(V,A) has a good decomposition if A has two disjoint sets A_1 and A_2 such that both (V,A_1) and (V,A_2) are strong. Let T be a digraph with t vertices u_1,... , u_t and let H_1,... H_t be digraphs such that H_i has vertices u_i,j_i, 1< j_i< n_i. Then the composition Q=T[H_1,... , H_t] is a digraph with vertex set {u_i,j_i| 1< i< t, 1< j_i< n_i} and arc set A(Q)=∪^t_i=1A(H_i)∪{u_ij_iu_pq_p| u_iu_p∈ A(T), 1< j_i< n_i, 1< q_p< n_p}. For digraph compositions Q=T[H_1,... H_t], we obtain sufficient conditions for Q to have a good decomposition and a characterization of Q with a good decomposition when T is a strong semicomplete digraph and each H_i is an arbitrary digraph with at least two vertices. For digraph products, we prove the following: (a) if k≥ 2 is an integer and G is a strong digraph which has a collection of arc-disjoint cycles covering all vertices, then the Cartesian product digraph G^ k (the kth powers with respect to Cartesian product) has a good decomposition; (b) for any strong digraphs G, H, the strong product G H has a good decomposition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2019

Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions

A strong arc decomposition of a digraph D=(V,A) is a decomposition of it...
research
06/19/2019

Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

A digraph D=(V, A) has a good pair at a vertex r if D has a pair of arc-...
research
09/15/2023

On Induced Versions of Menger's Theorem on Sparse Graphs

Let A and B be sets of vertices in a graph G. Menger's theorem states th...
research
11/09/2019

Boundary-type Sets of Strong Product of Directed Graphs

Let D=(V,E) be a strongly connected digraph and let u ,v∈ V(D). The maxi...
research
02/28/2022

Radio Number for the Cartesian Product of Two Trees

Let G be a simple connected graph. For any two vertices u and v, let d(u...
research
08/17/2020

Binary scalar products

Let A,B ⊆ℝ^d both span ℝ^d such that ⟨ a, b ⟩∈{0,1} holds for all a ∈ A,...
research
09/12/2023

Public key cryptosystems based on Iterated Functions Systems

Let f=(f_0,f_1,…, f_ν-1) be a collection of one-to-one functions from so...

Please sign up or login with your details

Forgot password? Click here to reset