Cordial Labeling of n-Chain Aztec Diamond Graphs

Abstract

A binary vertex labeling $f: V(G)\rightarrow\left\{0,1\right\}$ of a graph G is called a cordial labeling if $|v_f (0)-v_f (1)|\leq1$ and $|e_f (0)-e_f (1)|\leq1$. A graph G is cordial if it admits cordial labeling.. The dual graph obtained from an Aztec diamond of order n, where each square is a vertex and if two squares are adjacent in Aztec diamond then their corresponding vertices are linked by and edge in the dual graph; is known as Aztec diamond graph of order n. In this paper n-chain Aztec diamond graphs are proved to be cordial.