The Graphs \(C_7^{(t)}\) are Graceful for \(t \equiv 0,1 \pmod{4}\)

Yang Yuansheng1, Xu Xirong1, Xi Yue1, Li Huijun1, Khandoker Mohammed Mominul Haque2
1Department of Computer Science Dalian University of Technology Dalian, 116024, P. R. China
2Department of Computer Science and Engineering Shahjalal University of Science and Technology Sylhet-3114 , Bangladesh

Abstract

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 the graphs \(C_n^{(t)}\) are graceful if and only if \(nt \equiv 0, 3 \pmod{4}\). The conjecture has been shown true for \(n = 3, 5, 6, 4k\). In this paper, the conjecture is shown to be true for \(n = 7\).