论文成果
The Graphs C(13)(t) are Graceful for t equivalent to 0, 3 (mod 4)
- 点击次数：
- 论文类型：期刊论文
- 发表时间：2009-01-01
- 发表刊物：ARS COMBINATORIA
- 收录刊物：SCIE
- 文献类型：J
- 卷号：90
- 页面范围：25-32
- ISSN号：0381-7032
- 关键字：graceful graph; vertex labeling; edge labeling
- 摘要：Let C(n) denote the cycle with n vertices, and C(n)((t)) denote the graphs consisting of t copies of C(n) with a vertex in common. Koh et al. conjectured that C(n)((t)) is graceful if and only if nt = 0, 3 (mod 4). The conjecture has been shown true for n = 3, 5, 6, 7, 9, 11, 4k. In this paper, the conjecture is shown to be true for n = 13.
