Cycle With Parallel Chords Are Odd Even Graceful
S. Venkatesh1, P. Rajadurai2, K. Parameswari3, A. Atchayadevi4, K. Sangeetha5
1S. Venkatesh, Department of Mathematics, Srinivasa Ramanujan Centre, SASTRA Deemed University, Kumbakonam, Tamilnadu, India.
2P. Rajadurai, Department of Mathematics, Srinivasa Ramanujan Centre, SASTRA Deemed University, Kumbakonam, Tamilnadu, India.
3K. Parameswari, Department of Mathematics, Srinivasa Ramanujan Centre, SASTRA Deemed University, Kumbakonam, Tamilnadu, India.
4A. Atchayadevi, Department of Mathematics, Srinivasa Ramanujan Centre, SASTRA Deemed University, Kumbakonam, Tamilnadu, India
5K. Sangeetha, Department of Mathematics, Srinivasa Ramanujan Centre, SASTRA Deemed University, Kumbakonam, Tamilnadu, India
Manuscript received on 20 August 2019. | Revised Manuscript received on 07 September 2019. | Manuscript published on 30 September 2019. | PP: 3103-3107 | Volume-8 Issue-11, September 2019. | Retrieval Number: K24940981119/2019©BEIESP | DOI: 10.35940/ijitee.K2494.0981119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: If C_n is a cycle of length n, then the graph cycle with parallel chords is obtained from C_n by adding an “edge “is the graph obtained by attaching a pendant edge at each vertex of the cycle” C_(n.) In this paper we prove that the graphs ncycle w for n≡0,3(mod 4). the graph P_(a,b) obtained by identifying the end points of a internally disjoint paths each of length b, are odd even graceful for odd values of a and b.
Keywords: Cycles; Cycles with parallel chords; vertex labeling; odd even graceful labeling.
Scope of the Article: Parallel and Distributed Algorithms