Contents

-

The Graphs C5(t) are Graceful for t0,3(mod4)

Yang Yuansheng1, Lin Xiaohui1, Yu Chunyan1
1Department of Computer Science Dalian University of Technology Dalian, 116024, P. R. China

Abstract

Given t2 cycles Cn of length n3, each with a fixed vertex v0i, i=1,2,,t, let C(t)n denote the graph obtained from the union of the t cycles by identifying the t fixed vertices (v01=v02==v0t). Koh et al. conjectured that C(t)n is graceful if and only if nt0,3(mod4). The conjecture has been shown true for t=3,6,4k. In this paper, the conjecture is shown to be true for n=5.