Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers

A lemniscate graph, usually denoted by L n , m , is defined as a union of two cycles C n and C m that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions. The purpose of this paper is to study the cyclic cordiality of L n , m and their second powers . Our verification goes through by using the concept of finite cyclic groups.