Let be the complete graph with vertices. Let be a finite simple graph. A -decomposition of , denoted by -GD, is a pair , where is the vertex set of , and is a collection of subgraphs of , called blocks, such that each block is isomorphic to . In this paper, the discussed graphs are , , where are four kinds of graphs with eight vertices and eight edges. We obtain the existence spectrum of -GD.