完备图分拆为带一条弦的(2k-1)-长圈
완비도분탁위대일조현적(2k-1)-장권
Decompositions of Complete Graph into (2k-1)-Circles with One Chord
  • 万方数据
    数学研究与评论 수학연구여평론
    JOURNAL OF MATHEMATICAL RESEARCH AND EXPOSITION
    2006年 1期 56-62 ,共7页

    单秀玲%康庆德

    단수령%강경덕

    图设计%带洞图设计%差 圖設計%帶洞圖設計%差
    도설계%대동도설계%차
    graph design%holey graph design%difference
    本文给出了构造G-设计的一个统一方法及当v≡1(mod 4k)时的C2k-1 (r)-GD(v)的存在性,其中C10 (r),1≤r≤k-2表示带一条弦的2k-1长圈,r表示弦两个端点间的顶点个数.
    본문급출료구조G-설계적일개통일방법급당v≡1(mod 4k)시적C2k-1 (r)-GD(v)적존재성,기중C10 (r),1≤r≤k-2표시대일조현적2k-1장권,r표시현량개단점간적정점개수.
    In this paper, we give a unified method to construct G-designs and solve the existence of C2k-1 (r)-GD(v) for v ≡ 1 (mod 4k), where the graph C(r)C2k-1 (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.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문