摘要
In this paper, we give a unified method to construct G-designs and solve the existence of [C（2k-1）^（r）]-GD（v） for v=1（mod 4k）, where the graph C10^（r）,1≤r≤k-2, denotes a circle of length 2k - 1 with one chord and r is the number of vertices between the ends of the chord.
本文给出了构造G-设计的一个统一方法及当v≡1(mod 4k)时的C_(2k-1)^((r))-GD(v)的存在性,其中C_(10)^((r)),1≤r≤k-2表示带一条弦的2k-1长圈,r表示弦两个端点间的顶点个数。
基金
the Natural Science Foundation of Hebei Province (103146) and Doctoral Research Fund for Hebei Higher Learning Institutions
