On Crown Plan Design,

Let λK_v be the complete multigraph, and G be a finite simple graph. A G-design of λK_v is denoted by GD(v, G, λ). Crown graph Q_n is a unicyclic graph with extensive application. In this paper, we give the construction methods of graph design and recursive constructions of Crown graph design. Applying HGD, IGD and quasigroup, we compress the order v in GD(v, Q_n, λ) to 4n ≤ v < 8n when n is even, and to 4n ≤ v < 12n when n is odd. Also, the existence spectrum of GD(v, Q_n, λ) are determined for n=4,6,8 when λ ≥ 1, and n=5,7 when λ = 1.