On prime cordial labeling to pattern recognition of knight graphs

Prime cordial labeling is a form of graph labeling that connects ideas from graph theory and number theory. This labeling exists for a graph [Formula: see text] when there is a bijection [Formula: see text] and each edge [Formula: see text] is assigned the label [Formula: see text] when [Formula: see text], and the label [Formula: see text] when [Formula: see text], such that the absolute difference between the numbers of edges labeled [Formula: see text] and [Formula: see text] is at most [Formula: see text]. A graph [Formula: see text] is called prime cordial if it there exists a prime cordial labeling on [Formula: see text]. The aim of this paper is to investigate the prime cordial labeling of knight graphs.