Graceful and felicitous labeling of Stem-Lotus graph

Abstract

A graph obtained from a shell graph $C(2n+3, 2n)$ where $n \geq 1$ by adding a vertex in between each pair of adjacent vertices on the cycle, adding an edge in apex and two more chords is called a Stem-Lotus graph. In this paper, I have proved that a Stem-Lotus graph is graceful and also felicitous.