Abstract
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 P-n and cycles C-n, namely, P-n circle dot C-m. A graph is said to be logical labeling if it has a 0-1 labeling that satisfies certain properties. The corona G(1)circle dot G(2) of two graphs G(1) (with n(1) vertices and m(1) edges) and G(2) (with n(2) vertices and m(2) edges) is defined as the graph formed by taking one copy of G(1) and n(1) copies of G(2) and then connecting the ith vertex of G(1) with an edge to every vertex in the ith copy of G(2).