Contents

-

Decompositions of Kv Into Four Kinds of Graphs with Eight Vertices and Eight Edges

Yanfang Zhang1, Qingde Kang2
1College of Mathematics and Statistics Hebei University of Economics and Business Shijiazhuang 050061, P.R. China
2Institute of Mathematics, Hebei Normal University Shijiazhuang 050024, P.R. China

Abstract

Let Kv be the complete graph with v vertices. Let G be a finite simple graph. A G-decomposition of Kv, denoted by (v,G,1)-GD, is a pair (X,B), where X is the vertex set of Kv, and B is a collection of subgraphs of Kv, called blocks, such that each block is isomorphic to G. In this paper, the discussed graphs are Gi, i=1,2,3,4, where Gi are four kinds of graphs with eight vertices and eight edges. We obtain the existence spectrum of (v,Gi,1)-GD.

Keywords: G-decomposition; G-holey design; G-incomplete ho- ley design.