A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

A simple graph is called cordial if it admits 0‐1 labeling that satisfies certain conditions. The
second order of lemniscate graph is a graph of two second order of circles that have one …

In this study, we propose a new kind of graph labeling which we call logic labeling and
investigate the logically labeling of the corona between paths Pn and cycles Cn, namely …

The concepts of cordial labeling, signed product cordiality, and logical cordiality have been
introduced independently by different researchers as distinct labeling schemes. In this …

Objectives: The objective of this paper is to find exact proper d-lucky number for corona
product graphs of certain graphs. Methods: The results are proved by method of elaboration …