点击次数：

论文类型：期刊论文

发表时间：2007-10-01

发表刊物：ARS COMBINATORIA

收录刊物：SCIE、Scopus

卷号：85

页面范围：361-368

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 Cn with a vertex in common. Koh et al. conjectured that C-n((t)) is graceful if and only if nt equivalent to 0,3 (mod 4). The conjecture has been shown true for n = 3,5,6,7,4k. In this paper, the conjecture is shown to be true for n = 9.