Hits:

Indexed by:期刊论文

Date of Publication:2007-10-01

Journal:ARS COMBINATORIA

Included Journals:SCIE、Scopus

Volume:85

Page Number:361-368

ISSN No.:0381-7032

Key Words:graceful graph; vertex labeling; edge labeling

Abstract: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.