Prime cordial labeling of n-chain vertex merged staircase graphs

Abstract

A prime cordial labeling of a graph G with vertex set V is a bijection h:V → {1,2,..|V|} such that, for each edgeuv, the label 1 is assigned, if g.c.d[h(u), h(y)] = 1, otherwise 0, and the total number of edges labeled as 0, and the total number of edges labeled as 1, differ atmost by 1. In this paper, we prove that n-chain vertex merged staircase graphs are prime cordial.