| 完备图分拆为带一条弦的(2k-1)-长圈 |
| |
| 引用本文： | 单秀玲,康庆德. 完备图分拆为带一条弦的(2k-1)-长圈[J]. 数学研究及应用, 2006, 26(1): 56-62 |
| |
| 作者姓名： | 单秀玲 康庆德 |
| |
| 作者单位： | 河北师范大学数学与信息科学学院,河北石,家庄,050016 |
| |
| 基金项目： | the Natural Science Foundation of Hebei Province (103146) and Doctoral Research Fund for Hebei Higher Learning Institutions |
| |
| 摘 要： | 本文给出了构造G-设计的一个统一方法及当v≡1(mod 4k)时的C_(2k-1)~((r))-GD(v)的存在性,其中C_(10)~((r)),1≤r≤k-2表示带一条弦的2k-1长圈,r表示弦两个端点间的顶点个数。
|
| 关 键 词： | 图设计 带洞图设计 差 |
| 文章编号： | 1000-341X(2006)01-0056-07 |
| 收稿时间： | 2004-02-09 |
| 修稿时间： | 2004-02-09 |
Decompositions of Complete Graph into (2k-1)-Circles with One Chord |
| |
| SHAN Xiu-ling and KANG Qing-de. Decompositions of Complete Graph into (2k-1)-Circles with One Chord[J]. Journal of Mathematical Research with Applications, 2006, 26(1): 56-62 |
| |
| Authors: | SHAN Xiu-ling and KANG Qing-de |
| |
| Affiliation: | Dept. of Math.; Hebei Normal University; Shijiazhuang; China;Dept. of Math.; Hebei Normal University; Shijiazhuang; China |
| |
| 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 $vequiv 1~(mod~4k)$, where the graph $C_{2k-1}^{(r)}$, $1leq rleq 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. |
| |
| Keywords: | graph design holey graph design difference. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
