Product Cordial Labeling of n-chain Aztec Diamond Graphs

Abstract

A function $f: V$ to $\left\{0, 1\right\}$ of a graph G is known to be a product cordial labeling if each edge $uv$ is given the label $f (u) f (v)$ the resulting number of vertices with labels 0 and the number of vertices with labels $1$ vary to the maximum of $1$, and the number of edge labels with $0$ and the number of edge labels with $1$ vary also to the maximum of $1$. A graph that satisfies the conditions of product cordial labeling is named product cordial. In this paper product cordial labeling is proved for $n$-chain Aztec diamond graph for even positive integer $n$.