Abstract
A simple graph is called cordial if it admits 0-1 labeling that satisfies certain conditions. A lemniscate graph is a graph of two circles that have one vertex in common. In this paper, we give necessary and sufficient conditions that the corona product of paths and lemniscate graphs to be cordial.