Contents

-

Large Sets of P3-Decompositions of Complete Multipartite Graphs

Hongtao Zhao1, Feifei Fan1
1School of Mathematics and Physics North China Electric Power University Beijing 102206 , P.R. China

Abstract

Let H and G be two graphs, where G is a simple subgraph of H. A G-decomposition of H, denoted by (H,G)-GD, is a partition of all the edges 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 determine the existence spectrums for (λKm,n,P3)-EGD and (λKn,n,n,P3)-LGD.