| Decompositions of Complete Graph into (2k-1)-Circles with One Chord |
| Received:February 09, 2004 |
| Key Words:
graph design holey graph design difference.
|
| Fund Project:the Natural Science Foundation of Hebei Province (103146) and Doctoral Research Fund for Hebei Higher Learning Institutions |
|
| Hits: 3430 |
| Download times: 2146 |
| Abstract: |
| 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\equiv 1~(mod~4k)$, where the graph $C_{2k-1}^{(r)}$, $1\leq r\leq 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. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2006.01.011 |
| View Full Text View/Add Comment |
