Contents

-

On Large Sets of K1,p-Decomposition of Complete Bipartite Graphs

Yanfang Zhang1, Zhijun Wang 1, Yingwei Chen1
1College of Mathematics and Statistics Hebei University of Economics and Business Shijiazhuang 050061, P.R. China

Abstract

Let H and G be two simple graphs, where G is a 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 (called small sets). In this paper, we investigate the existence of (λKmn,K1,p)-LGD and obtain some existence results, where p3 is a prime.

Keywords: large set; K,,,-decomposition; complete bipartite graph