Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
Abstract
A digraph has a good decomposition if has two disjoint sets and such that both and are strong. Let be a digraph with vertices and let be digraphs such that has vertices Then the composition is a digraph with vertex set and arc set For digraph compositions , we obtain sufficient conditions for to have a good decomposition and a characterization of with a good decomposition when is a strong semicomplete digraph and each is an arbitrary digraph with at least two vertices. For digraph products, we prove the following: (a) if is an integer and is a strong digraph which has a collection of arc-disjoint cycles covering all vertices, then the Cartesian product digraph (the th powers with respect to Cartesian product) has a good decomposition; (b) for any strong digraphs , the strong product 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}
}