Contents

-

Large Sets of Oriented P3-Decompositions of Directed Complete Bipartite Graphs

Yanfang Zhang1, Qi Wang2, Feifei Fan3
1College of Mathematics and Statistics Hebei University of Economics and Business Shijiazhuang 050061, P.R, China
2 Graduate School Hebei University of Economics and Business Shijiazhuang 050061, P.R. China
3School of Mathematics and Physics North China Electric Power University Beijing 102206, P.R. China

Abstract

Let H and G be two graphs (or digraphs), where G is a subgraph of H. A G-decomposition of H, denoted by (H,G)-GD, is a partition of all the edges (or arcs) of H into subgraphs (G-blocks), each of which is isomorphic to G. A large set of (H,G)-GD, denoted by (H,G)-LGD, is a partition of all subgraphs isomorphic to G of H into (H,G)-GDs. In this paper, we obtain the existence spectra of (ADKm,n,P3i)-LGD, where P3i (i=1,2,3) are the three types of oriented P3.