English

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

Discrete Mathematics 2018-12-24 v1 Combinatorics

Abstract

A digraph D=(V,A)D=(V,A) has a good decomposition if AA has two disjoint sets A1A_1 and A2A_2 such that both (V,A1)(V,A_1) and (V,A2)(V,A_2) are strong. Let TT be a digraph with tt vertices u1,,utu_1,\dots , u_t and let H1,HtH_1,\dots H_t be digraphs such that HiH_i has vertices ui,ji, 1jini.u_{i,j_i},\ 1\le j_i\le n_i. Then the composition Q=T[H1,,Ht]Q=T[H_1,\dots , H_t] is a digraph with vertex set {ui,ji1it,1jini}\{u_{i,j_i}\mid 1\le i\le t, 1\le j_i\le n_i\} and arc set A(Q)=i=1tA(Hi){uijiupqpuiupA(T),1jini,1qpnp}.A(Q)=\cup^t_{i=1}A(H_i)\cup \{u_{ij_i}u_{pq_p}\mid u_iu_p\in A(T), 1\le j_i\le n_i, 1\le q_p\le n_p\}. For digraph compositions Q=T[H1,Ht]Q=T[H_1,\dots H_t], we obtain sufficient conditions for QQ to have a good decomposition and a characterization of QQ with a good decomposition when TT is a strong semicomplete digraph and each HiH_i is an arbitrary digraph with at least two vertices. For digraph products, we prove the following: (a) if k2k\geq 2 is an integer and GG is a strong digraph which has a collection of arc-disjoint cycles covering all vertices, then the Cartesian product digraph GkG^{\square k} (the kkth powers with respect to Cartesian product) has a good decomposition; (b) for any strong digraphs G,HG, H, the strong product GHG\boxtimes H has a good decomposition.

Keywords

Cite

@article{arxiv.1812.08809,
  title  = {Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs},
  author = {Yuefang Sun and Gregory Gutin and Jiangdong Ai},
  journal= {arXiv preprint arXiv:1812.08809},
  year   = {2018}
}