The concepts of cordial labeling, signed product cordiality, and logical cordiality have
been introduced independently by different researchers as distinct labeling schemes. In this paper,
we demonstrate the equivalence of these concepts. Specifically, we prove that a graph G is cordial if
and only if it is signed product cordial, if and only if it is logically cordial. Additionally, we establish
that a graph G admits permuted cordial labeling if and only if it exhibits cubic roots cordial labeling.
Furthermore, we leverage this newfound equivalence to analyze the cordiality properties of several
standard graphs. |
