Abstract
A graph is said to be cordial if it has 0-1 labeling that satisfies certain conditions. A kite graph, C-n (sic) P-m, is formed by a cycle, C-n, with a path, P-m, and joining them by an edge uv, where u is an arbitrary vertex of C-n and v is a vertex of degree one of P-m. In this paper, we study the cordiality of kite graphs. We also investigate the conditions under which the corona of cycles and kite graphs are cordial.